./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/mods.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/mods.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 --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 f15d84a1f588b4a2fae1a1f53311fed1d9572550b31409f886696465cdc8f8ba --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 15:04:18,820 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 15:04:18,902 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 15:04:18,905 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 15:04:18,906 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 15:04:18,931 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 15:04:18,933 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 15:04:18,934 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 15:04:18,934 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 15:04:18,935 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 15:04:18,936 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 15:04:18,936 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 15:04:18,937 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 15:04:18,937 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 15:04:18,937 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 15:04:18,939 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 15:04:18,939 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 15:04:18,940 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 15:04:18,940 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 15:04:18,940 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 15:04:18,941 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 15:04:18,942 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 15:04:18,942 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 15:04:18,942 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 15:04:18,943 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 15:04:18,943 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 15:04:18,943 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 15:04:18,944 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 15:04:18,944 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 15:04:18,944 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 15:04:18,944 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 15:04:18,944 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 15:04:18,945 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:04:18,945 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 15:04:18,945 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 15:04:18,945 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 15:04:18,946 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 15:04:18,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 15:04:18,946 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 15:04:18,947 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 15:04:18,947 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 15:04:18,948 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 15:04:18,948 INFO L153 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 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 -> f15d84a1f588b4a2fae1a1f53311fed1d9572550b31409f886696465cdc8f8ba [2024-10-12 15:04:19,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 15:04:19,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 15:04:19,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 15:04:19,239 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 15:04:19,240 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 15:04:19,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/mods.c [2024-10-12 15:04:20,598 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 15:04:20,764 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 15:04:20,766 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/mods.c [2024-10-12 15:04:20,775 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/575030def/8b5ba9803fc640cab68c6d11d6aa6904/FLAGb36b86696 [2024-10-12 15:04:20,785 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/575030def/8b5ba9803fc640cab68c6d11d6aa6904 [2024-10-12 15:04:20,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 15:04:20,789 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 15:04:20,792 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 15:04:20,792 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 15:04:20,797 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 15:04:20,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:04:20" (1/1) ... [2024-10-12 15:04:20,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38b84d03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:04:20, skipping insertion in model container [2024-10-12 15:04:20,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:04:20" (1/1) ... [2024-10-12 15:04:20,820 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 15:04:20,969 WARN L248 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/mods.c[587,600] [2024-10-12 15:04:20,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:04:20,994 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 15:04:21,006 WARN L248 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/mods.c[587,600] [2024-10-12 15:04:21,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:04:21,030 INFO L204 MainTranslator]: Completed translation [2024-10-12 15:04:21,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:04:21 WrapperNode [2024-10-12 15:04:21,031 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 15:04:21,032 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 15:04:21,032 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 15:04:21,032 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 15:04:21,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:04:21" (1/1) ... [2024-10-12 15:04:21,043 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:04:21" (1/1) ... [2024-10-12 15:04:21,061 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 104 [2024-10-12 15:04:21,063 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 15:04:21,063 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 15:04:21,064 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 15:04:21,064 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 15:04:21,073 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:04:21" (1/1) ... [2024-10-12 15:04:21,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:04:21" (1/1) ... [2024-10-12 15:04:21,080 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:04:21" (1/1) ... [2024-10-12 15:04:21,098 INFO L175 MemorySlicer]: Split 21 memory accesses to 4 slices as follows [2, 7, 7, 5]. 33 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0, 0]. The 5 writes are split as follows [0, 0, 3, 2]. [2024-10-12 15:04:21,098 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:04:21" (1/1) ... [2024-10-12 15:04:21,098 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:04:21" (1/1) ... [2024-10-12 15:04:21,106 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:04:21" (1/1) ... [2024-10-12 15:04:21,109 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:04:21" (1/1) ... [2024-10-12 15:04:21,111 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:04:21" (1/1) ... [2024-10-12 15:04:21,112 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:04:21" (1/1) ... [2024-10-12 15:04:21,117 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 15:04:21,118 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 15:04:21,118 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 15:04:21,118 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 15:04:21,119 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:04:21" (1/1) ... [2024-10-12 15:04:21,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:04:21,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:04:21,147 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 15:04:21,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 15:04:21,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 15:04:21,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 15:04:21,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 15:04:21,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 15:04:21,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-12 15:04:21,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 15:04:21,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 15:04:21,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 15:04:21,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-12 15:04:21,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-12 15:04:21,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-12 15:04:21,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 15:04:21,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 15:04:21,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 15:04:21,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 15:04:21,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-12 15:04:21,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-12 15:04:21,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 15:04:21,290 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 15:04:21,291 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 15:04:21,432 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-12 15:04:21,432 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 15:04:21,474 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 15:04:21,474 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-12 15:04:21,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:04:21 BoogieIcfgContainer [2024-10-12 15:04:21,475 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 15:04:21,477 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 15:04:21,477 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 15:04:21,480 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 15:04:21,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 03:04:20" (1/3) ... [2024-10-12 15:04:21,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e8f120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:04:21, skipping insertion in model container [2024-10-12 15:04:21,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:04:21" (2/3) ... [2024-10-12 15:04:21,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e8f120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:04:21, skipping insertion in model container [2024-10-12 15:04:21,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:04:21" (3/3) ... [2024-10-12 15:04:21,483 INFO L112 eAbstractionObserver]: Analyzing ICFG mods.c [2024-10-12 15:04:21,500 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 15:04:21,500 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 15:04:21,557 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 15:04:21,562 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@44a3bfa4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 15:04:21,562 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 15:04:21,566 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 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) [2024-10-12 15:04:21,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-12 15:04:21,570 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:04:21,570 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:04:21,570 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:04:21,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:04:21,574 INFO L85 PathProgramCache]: Analyzing trace with hash -270928915, now seen corresponding path program 1 times [2024-10-12 15:04:21,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:04:21,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376650906] [2024-10-12 15:04:21,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:04:21,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:04:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:04:21,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:04:21,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:04:21,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376650906] [2024-10-12 15:04:21,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376650906] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:04:21,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:04:21,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:04:21,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798190177] [2024-10-12 15:04:21,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:04:21,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 15:04:21,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:04:21,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 15:04:21,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:04:21,763 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 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) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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) [2024-10-12 15:04:21,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:04:21,791 INFO L93 Difference]: Finished difference Result 37 states and 59 transitions. [2024-10-12 15:04:21,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 15:04:21,794 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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 15 [2024-10-12 15:04:21,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:04:21,802 INFO L225 Difference]: With dead ends: 37 [2024-10-12 15:04:21,802 INFO L226 Difference]: Without dead ends: 17 [2024-10-12 15:04:21,805 INFO L431 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 [2024-10-12 15:04:21,808 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:04:21,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:04:21,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-10-12 15:04:21,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-10-12 15:04:21,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:04:21,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-10-12 15:04:21,836 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 15 [2024-10-12 15:04:21,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:04:21,837 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-10-12 15:04:21,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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) [2024-10-12 15:04:21,837 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2024-10-12 15:04:21,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-12 15:04:21,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:04:21,838 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:04:21,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 15:04:21,838 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:04:21,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:04:21,839 INFO L85 PathProgramCache]: Analyzing trace with hash -863276055, now seen corresponding path program 1 times [2024-10-12 15:04:21,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:04:21,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952970389] [2024-10-12 15:04:21,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:04:21,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:04:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:04:22,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:04:22,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:04:22,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952970389] [2024-10-12 15:04:22,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952970389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:04:22,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:04:22,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 15:04:22,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321174292] [2024-10-12 15:04:22,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:04:22,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:04:22,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:04:22,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:04:22,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:04:22,055 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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) [2024-10-12 15:04:22,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:04:22,122 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2024-10-12 15:04:22,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:04:22,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2024-10-12 15:04:22,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:04:22,124 INFO L225 Difference]: With dead ends: 38 [2024-10-12 15:04:22,125 INFO L226 Difference]: Without dead ends: 26 [2024-10-12 15:04:22,125 INFO L431 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 [2024-10-12 15:04:22,126 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 22 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:04:22,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 13 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:04:22,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-12 15:04:22,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2024-10-12 15:04:22,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:04:22,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-10-12 15:04:22,138 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 15 [2024-10-12 15:04:22,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:04:22,139 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-10-12 15:04:22,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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) [2024-10-12 15:04:22,139 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-10-12 15:04:22,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 15:04:22,139 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:04:22,140 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:04:22,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 15:04:22,140 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:04:22,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:04:22,142 INFO L85 PathProgramCache]: Analyzing trace with hash 405160390, now seen corresponding path program 1 times [2024-10-12 15:04:22,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:04:22,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182586090] [2024-10-12 15:04:22,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:04:22,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:04:22,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 15:04:22,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [584938641] [2024-10-12 15:04:22,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:04:22,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:04:22,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:04:22,261 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) [2024-10-12 15:04:22,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 15:04:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:04:22,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-12 15:04:22,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:04:22,396 INFO L378 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 [2024-10-12 15:04:22,420 INFO L378 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 [2024-10-12 15:04:22,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 15:04:22,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 15:04:22,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 15:04:22,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:04:22,704 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:04:23,228 INFO L378 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 42 treesize of output 38 [2024-10-12 15:04:23,235 INFO L378 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 51 treesize of output 47 [2024-10-12 15:04:23,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:04:23,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:04:23,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182586090] [2024-10-12 15:04:23,332 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-12 15:04:23,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584938641] [2024-10-12 15:04:23,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584938641] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:04:23,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 15:04:23,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2024-10-12 15:04:23,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052903858] [2024-10-12 15:04:23,334 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 15:04:23,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-12 15:04:23,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:04:23,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-12 15:04:23,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2024-10-12 15:04:23,339 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 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) [2024-10-12 15:04:23,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:04:23,869 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2024-10-12 15:04:23,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 15:04:23,870 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-12 15:04:23,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:04:23,871 INFO L225 Difference]: With dead ends: 46 [2024-10-12 15:04:23,872 INFO L226 Difference]: Without dead ends: 44 [2024-10-12 15:04:23,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2024-10-12 15:04:23,874 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 57 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 15:04:23,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 126 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 15:04:23,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-12 15:04:23,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2024-10-12 15:04:23,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:04:23,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-10-12 15:04:23,885 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 19 [2024-10-12 15:04:23,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:04:23,885 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-10-12 15:04:23,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 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) [2024-10-12 15:04:23,885 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-10-12 15:04:23,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-12 15:04:23,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:04:23,886 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:04:23,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 15:04:24,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:04:24,087 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:04:24,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:04:24,088 INFO L85 PathProgramCache]: Analyzing trace with hash 316854210, now seen corresponding path program 2 times [2024-10-12 15:04:24,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:04:24,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636102234] [2024-10-12 15:04:24,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:04:24,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:04:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:04:24,288 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 15:04:24,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:04:24,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636102234] [2024-10-12 15:04:24,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636102234] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:04:24,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335901152] [2024-10-12 15:04:24,289 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 15:04:24,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:04:24,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:04:24,292 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) [2024-10-12 15:04:24,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 15:04:24,374 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 15:04:24,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 15:04:24,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 15:04:24,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:04:24,432 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 15:04:24,432 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:04:24,466 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 15:04:24,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335901152] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:04:24,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 15:04:24,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-10-12 15:04:24,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677795515] [2024-10-12 15:04:24,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 15:04:24,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 15:04:24,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:04:24,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 15:04:24,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-12 15:04:24,472 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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) [2024-10-12 15:04:24,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:04:24,596 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2024-10-12 15:04:24,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 15:04:24,597 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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) Word has length 20 [2024-10-12 15:04:24,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:04:24,597 INFO L225 Difference]: With dead ends: 77 [2024-10-12 15:04:24,598 INFO L226 Difference]: Without dead ends: 43 [2024-10-12 15:04:24,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-10-12 15:04:24,599 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 19 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:04:24,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 48 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:04:24,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-12 15:04:24,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2024-10-12 15:04:24,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:04:24,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-10-12 15:04:24,605 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 20 [2024-10-12 15:04:24,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:04:24,606 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-10-12 15:04:24,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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) [2024-10-12 15:04:24,606 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-10-12 15:04:24,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-12 15:04:24,607 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:04:24,607 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:04:24,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 15:04:24,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-12 15:04:24,808 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:04:24,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:04:24,808 INFO L85 PathProgramCache]: Analyzing trace with hash -732578568, now seen corresponding path program 3 times [2024-10-12 15:04:24,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:04:24,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067539430] [2024-10-12 15:04:24,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:04:24,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:04:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:04:24,940 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 15:04:24,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:04:24,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067539430] [2024-10-12 15:04:24,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067539430] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:04:24,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206435141] [2024-10-12 15:04:24,941 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 15:04:24,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:04:24,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:04:24,943 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) [2024-10-12 15:04:24,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 15:04:25,012 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-12 15:04:25,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 15:04:25,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 15:04:25,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:04:25,055 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 15:04:25,056 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:04:25,104 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 15:04:25,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206435141] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:04:25,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 15:04:25,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-10-12 15:04:25,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274971950] [2024-10-12 15:04:25,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 15:04:25,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 15:04:25,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:04:25,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 15:04:25,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-12 15:04:25,109 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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) [2024-10-12 15:04:25,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:04:25,223 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2024-10-12 15:04:25,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 15:04:25,224 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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) Word has length 21 [2024-10-12 15:04:25,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:04:25,224 INFO L225 Difference]: With dead ends: 43 [2024-10-12 15:04:25,224 INFO L226 Difference]: Without dead ends: 35 [2024-10-12 15:04:25,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-10-12 15:04:25,226 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 47 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:04:25,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 34 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:04:25,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-12 15:04:25,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2024-10-12 15:04:25,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 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) [2024-10-12 15:04:25,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-10-12 15:04:25,231 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 21 [2024-10-12 15:04:25,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:04:25,231 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-10-12 15:04:25,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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) [2024-10-12 15:04:25,232 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-10-12 15:04:25,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 15:04:25,232 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:04:25,232 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:04:25,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 15:04:25,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:04:25,433 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:04:25,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:04:25,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1546241993, now seen corresponding path program 4 times [2024-10-12 15:04:25,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:04:25,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927134399] [2024-10-12 15:04:25,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:04:25,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:04:25,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 15:04:25,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1946001373] [2024-10-12 15:04:25,497 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-12 15:04:25,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:04:25,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:04:25,498 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) [2024-10-12 15:04:25,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 15:04:25,610 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-12 15:04:25,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 15:04:25,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-10-12 15:04:25,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:04:25,624 INFO L378 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 [2024-10-12 15:04:25,639 INFO L378 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 [2024-10-12 15:04:25,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-10-12 15:04:25,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-10-12 15:04:25,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-10-12 15:04:25,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 15:04:25,923 INFO L378 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 1 case distinctions, treesize of input 26 treesize of output 21 [2024-10-12 15:04:25,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 15:04:25,961 INFO L378 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 1 case distinctions, treesize of input 26 treesize of output 21 [2024-10-12 15:04:26,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 15:04:26,047 INFO L378 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 1 case distinctions, treesize of input 26 treesize of output 21 [2024-10-12 15:04:26,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 15:04:26,087 INFO L378 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 1 case distinctions, treesize of input 26 treesize of output 21 [2024-10-12 15:04:26,168 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:04:26,168 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:04:27,188 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:04:27,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:04:27,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927134399] [2024-10-12 15:04:27,188 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-12 15:04:27,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946001373] [2024-10-12 15:04:27,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946001373] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:04:27,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 15:04:27,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2024-10-12 15:04:27,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879669752] [2024-10-12 15:04:27,189 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 15:04:27,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-12 15:04:27,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:04:27,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-12 15:04:27,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=957, Unknown=0, NotChecked=0, Total=1122 [2024-10-12 15:04:27,192 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 34 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 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) [2024-10-12 15:04:31,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:04:31,791 INFO L93 Difference]: Finished difference Result 119 states and 142 transitions. [2024-10-12 15:04:31,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-10-12 15:04:31,791 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 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 23 [2024-10-12 15:04:31,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:04:31,793 INFO L225 Difference]: With dead ends: 119 [2024-10-12 15:04:31,793 INFO L226 Difference]: Without dead ends: 117 [2024-10-12 15:04:31,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1704 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1120, Invalid=5686, Unknown=0, NotChecked=0, Total=6806 [2024-10-12 15:04:31,795 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 233 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:04:31,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 223 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 15:04:31,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-12 15:04:31,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 42. [2024-10-12 15:04:31,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 41 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:04:31,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2024-10-12 15:04:31,818 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 23 [2024-10-12 15:04:31,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:04:31,818 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-10-12 15:04:31,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 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) [2024-10-12 15:04:31,819 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2024-10-12 15:04:31,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-12 15:04:31,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:04:31,820 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:04:31,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-12 15:04:32,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:04:32,021 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:04:32,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:04:32,021 INFO L85 PathProgramCache]: Analyzing trace with hash -2060537951, now seen corresponding path program 5 times [2024-10-12 15:04:32,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:04:32,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791918510] [2024-10-12 15:04:32,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:04:32,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:04:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:04:32,176 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:04:32,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:04:32,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791918510] [2024-10-12 15:04:32,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791918510] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:04:32,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440090043] [2024-10-12 15:04:32,177 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-12 15:04:32,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:04:32,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:04:32,178 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) [2024-10-12 15:04:32,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 15:04:32,284 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-10-12 15:04:32,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 15:04:32,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 15:04:32,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:04:32,340 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:04:32,340 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:04:32,383 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:04:32,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440090043] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:04:32,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 15:04:32,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2024-10-12 15:04:32,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594788358] [2024-10-12 15:04:32,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 15:04:32,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-12 15:04:32,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:04:32,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-12 15:04:32,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-10-12 15:04:32,385 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 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) [2024-10-12 15:04:32,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:04:32,506 INFO L93 Difference]: Finished difference Result 105 states and 123 transitions. [2024-10-12 15:04:32,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 15:04:32,506 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 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 24 [2024-10-12 15:04:32,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:04:32,508 INFO L225 Difference]: With dead ends: 105 [2024-10-12 15:04:32,508 INFO L226 Difference]: Without dead ends: 58 [2024-10-12 15:04:32,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-10-12 15:04:32,509 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 51 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:04:32,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 55 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:04:32,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-12 15:04:32,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2024-10-12 15:04:32,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 38 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) [2024-10-12 15:04:32,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2024-10-12 15:04:32,528 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 24 [2024-10-12 15:04:32,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:04:32,528 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2024-10-12 15:04:32,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 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) [2024-10-12 15:04:32,529 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2024-10-12 15:04:32,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-12 15:04:32,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:04:32,530 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:04:32,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-12 15:04:32,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:04:32,731 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:04:32,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:04:32,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1281102295, now seen corresponding path program 6 times [2024-10-12 15:04:32,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:04:32,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522066935] [2024-10-12 15:04:32,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:04:32,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:04:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:04:32,867 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 15:04:32,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:04:32,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522066935] [2024-10-12 15:04:32,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522066935] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:04:32,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227232313] [2024-10-12 15:04:32,868 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-12 15:04:32,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:04:32,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:04:32,870 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) [2024-10-12 15:04:32,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-12 15:04:32,957 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-10-12 15:04:32,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 15:04:32,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 15:04:32,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:04:33,025 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 15:04:33,026 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:04:33,083 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 15:04:33,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227232313] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:04:33,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 15:04:33,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2024-10-12 15:04:33,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149827968] [2024-10-12 15:04:33,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 15:04:33,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-12 15:04:33,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:04:33,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-12 15:04:33,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-10-12 15:04:33,085 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 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) [2024-10-12 15:04:33,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:04:33,195 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2024-10-12 15:04:33,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 15:04:33,195 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 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 25 [2024-10-12 15:04:33,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:04:33,196 INFO L225 Difference]: With dead ends: 56 [2024-10-12 15:04:33,196 INFO L226 Difference]: Without dead ends: 44 [2024-10-12 15:04:33,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-12 15:04:33,197 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 68 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:04:33,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 48 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:04:33,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-12 15:04:33,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 29. [2024-10-12 15:04:33,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 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) [2024-10-12 15:04:33,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-10-12 15:04:33,205 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 25 [2024-10-12 15:04:33,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:04:33,206 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-10-12 15:04:33,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 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) [2024-10-12 15:04:33,206 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-10-12 15:04:33,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-12 15:04:33,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:04:33,207 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:04:33,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-12 15:04:33,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:04:33,407 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:04:33,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:04:33,408 INFO L85 PathProgramCache]: Analyzing trace with hash 444924774, now seen corresponding path program 7 times [2024-10-12 15:04:33,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:04:33,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173151128] [2024-10-12 15:04:33,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:04:33,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:04:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 15:04:33,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1465339837] [2024-10-12 15:04:33,478 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-12 15:04:33,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:04:33,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:04:33,480 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) [2024-10-12 15:04:33,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-12 15:04:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:04:33,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-10-12 15:04:33,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:04:33,606 INFO L378 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 [2024-10-12 15:04:33,620 INFO L378 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 [2024-10-12 15:04:33,640 INFO L378 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 19 treesize of output 18 [2024-10-12 15:04:33,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 15:04:33,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2024-10-12 15:04:33,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 15:04:33,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 15:04:33,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 15:04:33,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 15:04:33,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2024-10-12 15:04:33,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 15:04:33,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2024-10-12 15:04:33,990 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 15:04:33,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2024-10-12 15:04:34,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 15:04:34,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2024-10-12 15:04:34,149 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 15:04:34,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2024-10-12 15:04:34,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 15:04:34,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2024-10-12 15:04:34,304 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:04:34,304 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:04:35,589 INFO L378 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 194 treesize of output 182 [2024-10-12 15:04:35,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 15:04:35,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 15957 treesize of output 14677 [2024-10-12 15:04:38,930 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:04:38,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:04:38,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173151128] [2024-10-12 15:04:38,931 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-12 15:04:38,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465339837] [2024-10-12 15:04:38,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465339837] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:04:38,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 15:04:38,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 39 [2024-10-12 15:04:38,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655412777] [2024-10-12 15:04:38,931 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 15:04:38,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-10-12 15:04:38,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:04:38,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-12 15:04:38,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1289, Unknown=6, NotChecked=0, Total=1482 [2024-10-12 15:04:38,933 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 39 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:04:42,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-10-12 15:04:45,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:04:45,637 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2024-10-12 15:04:45,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-12 15:04:45,638 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-10-12 15:04:45,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:04:45,639 INFO L225 Difference]: With dead ends: 85 [2024-10-12 15:04:45,639 INFO L226 Difference]: Without dead ends: 83 [2024-10-12 15:04:45,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=422, Invalid=2652, Unknown=6, NotChecked=0, Total=3080 [2024-10-12 15:04:45,642 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 139 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:04:45,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 190 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-10-12 15:04:45,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-12 15:04:45,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 56. [2024-10-12 15:04:45,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 55 states have internal predecessors, (68), 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) [2024-10-12 15:04:45,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2024-10-12 15:04:45,658 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 27 [2024-10-12 15:04:45,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:04:45,658 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2024-10-12 15:04:45,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:04:45,659 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2024-10-12 15:04:45,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-12 15:04:45,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:04:45,659 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:04:45,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-12 15:04:45,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:04:45,860 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:04:45,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:04:45,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1432300002, now seen corresponding path program 8 times [2024-10-12 15:04:45,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:04:45,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033213797] [2024-10-12 15:04:45,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:04:45,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:04:45,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:04:46,042 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 15:04:46,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:04:46,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033213797] [2024-10-12 15:04:46,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033213797] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:04:46,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120654152] [2024-10-12 15:04:46,043 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 15:04:46,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:04:46,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:04:46,045 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) [2024-10-12 15:04:46,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-12 15:04:46,140 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 15:04:46,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 15:04:46,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 15:04:46,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:04:46,201 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 15:04:46,201 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:04:46,257 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 15:04:46,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120654152] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:04:46,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 15:04:46,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2024-10-12 15:04:46,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863997] [2024-10-12 15:04:46,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 15:04:46,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-12 15:04:46,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:04:46,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-12 15:04:46,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-10-12 15:04:46,259 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 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) [2024-10-12 15:04:46,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:04:46,420 INFO L93 Difference]: Finished difference Result 130 states and 151 transitions. [2024-10-12 15:04:46,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 15:04:46,420 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 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 [2024-10-12 15:04:46,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:04:46,421 INFO L225 Difference]: With dead ends: 130 [2024-10-12 15:04:46,421 INFO L226 Difference]: Without dead ends: 94 [2024-10-12 15:04:46,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 43 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2024-10-12 15:04:46,422 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 90 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:04:46,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 63 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:04:46,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-12 15:04:46,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 68. [2024-10-12 15:04:46,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.164179104477612) internal successors, (78), 67 states have internal predecessors, (78), 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) [2024-10-12 15:04:46,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2024-10-12 15:04:46,441 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 28 [2024-10-12 15:04:46,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:04:46,441 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2024-10-12 15:04:46,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 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) [2024-10-12 15:04:46,442 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2024-10-12 15:04:46,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-12 15:04:46,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:04:46,442 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:04:46,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-12 15:04:46,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-12 15:04:46,644 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:04:46,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:04:46,644 INFO L85 PathProgramCache]: Analyzing trace with hash 637829400, now seen corresponding path program 9 times [2024-10-12 15:04:46,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:04:46,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644377077] [2024-10-12 15:04:46,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:04:46,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:04:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:04:46,844 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-12 15:04:46,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:04:46,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644377077] [2024-10-12 15:04:46,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644377077] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:04:46,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816560418] [2024-10-12 15:04:46,845 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 15:04:46,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:04:46,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:04:46,846 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) [2024-10-12 15:04:46,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-12 15:04:46,965 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-12 15:04:46,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 15:04:46,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 15:04:46,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:04:47,031 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-12 15:04:47,032 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:04:47,097 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-12 15:04:47,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816560418] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:04:47,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 15:04:47,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2024-10-12 15:04:47,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421079370] [2024-10-12 15:04:47,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 15:04:47,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-12 15:04:47,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:04:47,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-12 15:04:47,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-10-12 15:04:47,099 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 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) [2024-10-12 15:04:47,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:04:47,406 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2024-10-12 15:04:47,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 15:04:47,407 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 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 [2024-10-12 15:04:47,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:04:47,407 INFO L225 Difference]: With dead ends: 111 [2024-10-12 15:04:47,407 INFO L226 Difference]: Without dead ends: 79 [2024-10-12 15:04:47,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 44 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2024-10-12 15:04:47,408 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 80 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 15:04:47,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 126 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 15:04:47,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-12 15:04:47,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 57. [2024-10-12 15:04:47,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 56 states have internal predecessors, (62), 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) [2024-10-12 15:04:47,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2024-10-12 15:04:47,424 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 29 [2024-10-12 15:04:47,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:04:47,425 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2024-10-12 15:04:47,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 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) [2024-10-12 15:04:47,425 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2024-10-12 15:04:47,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-12 15:04:47,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:04:47,426 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:04:47,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-12 15:04:47,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:04:47,627 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:04:47,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:04:47,627 INFO L85 PathProgramCache]: Analyzing trace with hash -804498519, now seen corresponding path program 10 times [2024-10-12 15:04:47,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:04:47,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622045808] [2024-10-12 15:04:47,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:04:47,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:04:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 15:04:47,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [982498241] [2024-10-12 15:04:47,718 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-12 15:04:47,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:04:47,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:04:47,720 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) [2024-10-12 15:04:47,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-12 15:04:47,852 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-12 15:04:47,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 15:04:47,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 94 conjuncts are in the unsatisfiable core [2024-10-12 15:04:47,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:04:47,865 INFO L378 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 [2024-10-12 15:04:47,877 INFO L378 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 [2024-10-12 15:04:47,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2024-10-12 15:04:47,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 15:04:47,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 40 [2024-10-12 15:04:47,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 15:04:47,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 52 [2024-10-12 15:04:48,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-10-12 15:04:48,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-10-12 15:04:48,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2024-10-12 15:04:48,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2024-10-12 15:04:48,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 15:04:48,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2024-10-12 15:04:48,368 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 15:04:48,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2024-10-12 15:04:48,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 15:04:48,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2024-10-12 15:04:48,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 15:04:48,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2024-10-12 15:04:48,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 15:04:48,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2024-10-12 15:04:48,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 15:04:48,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2024-10-12 15:04:48,686 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 15:04:48,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2024-10-12 15:04:48,749 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 15:04:48,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2024-10-12 15:04:48,871 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:04:48,872 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:04:51,009 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:04:51,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:04:51,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622045808] [2024-10-12 15:04:51,010 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-12 15:04:51,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982498241] [2024-10-12 15:04:51,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982498241] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:04:51,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 15:04:51,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-12 15:04:51,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212758042] [2024-10-12 15:04:51,011 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 15:04:51,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-12 15:04:51,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:04:51,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-12 15:04:51,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=2126, Unknown=0, NotChecked=0, Total=2450 [2024-10-12 15:04:51,012 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 50 states, 50 states have (on average 1.16) internal successors, (58), 50 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:05:00,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-10-12 15:05:10,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:05:10,992 INFO L93 Difference]: Finished difference Result 190 states and 220 transitions. [2024-10-12 15:05:10,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2024-10-12 15:05:10,993 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.16) internal successors, (58), 50 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-12 15:05:10,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:05:10,994 INFO L225 Difference]: With dead ends: 190 [2024-10-12 15:05:10,994 INFO L226 Difference]: Without dead ends: 188 [2024-10-12 15:05:10,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3519 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=2000, Invalid=12280, Unknown=0, NotChecked=0, Total=14280 [2024-10-12 15:05:10,997 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 383 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 1702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2024-10-12 15:05:10,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 395 Invalid, 1702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2024-10-12 15:05:10,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-12 15:05:11,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 80. [2024-10-12 15:05:11,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.1645569620253164) internal successors, (92), 79 states have internal predecessors, (92), 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) [2024-10-12 15:05:11,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2024-10-12 15:05:11,024 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 31 [2024-10-12 15:05:11,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:05:11,024 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2024-10-12 15:05:11,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.16) internal successors, (58), 50 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:05:11,024 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2024-10-12 15:05:11,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-12 15:05:11,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:05:11,025 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:05:11,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-12 15:05:11,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-12 15:05:11,226 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:05:11,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:05:11,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1666957567, now seen corresponding path program 11 times [2024-10-12 15:05:11,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:05:11,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296858476] [2024-10-12 15:05:11,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:05:11,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:05:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:05:11,438 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-12 15:05:11,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:05:11,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296858476] [2024-10-12 15:05:11,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296858476] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:05:11,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807546801] [2024-10-12 15:05:11,439 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-12 15:05:11,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:05:11,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:05:11,441 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) [2024-10-12 15:05:11,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-12 15:05:11,909 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-10-12 15:05:11,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 15:05:11,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-12 15:05:11,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:05:11,987 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-12 15:05:11,988 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:05:12,054 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-12 15:05:12,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807546801] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:05:12,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 15:05:12,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2024-10-12 15:05:12,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635616054] [2024-10-12 15:05:12,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 15:05:12,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-12 15:05:12,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:05:12,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-12 15:05:12,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2024-10-12 15:05:12,056 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. Second operand has 20 states, 20 states have (on average 1.8) internal successors, (36), 20 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) [2024-10-12 15:05:12,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:05:12,276 INFO L93 Difference]: Finished difference Result 173 states and 194 transitions. [2024-10-12 15:05:12,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 15:05:12,277 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.8) internal successors, (36), 20 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) Word has length 32 [2024-10-12 15:05:12,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:05:12,278 INFO L225 Difference]: With dead ends: 173 [2024-10-12 15:05:12,278 INFO L226 Difference]: Without dead ends: 136 [2024-10-12 15:05:12,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 48 SyntacticMatches, 9 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=401, Unknown=0, NotChecked=0, Total=552 [2024-10-12 15:05:12,278 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 90 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 15:05:12,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 94 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 15:05:12,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-12 15:05:12,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 100. [2024-10-12 15:05:12,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.1313131313131313) internal successors, (112), 99 states have internal predecessors, (112), 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) [2024-10-12 15:05:12,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 112 transitions. [2024-10-12 15:05:12,310 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 112 transitions. Word has length 32 [2024-10-12 15:05:12,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:05:12,310 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 112 transitions. [2024-10-12 15:05:12,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.8) internal successors, (36), 20 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) [2024-10-12 15:05:12,310 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2024-10-12 15:05:12,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-12 15:05:12,311 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:05:12,311 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:05:12,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-12 15:05:12,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-12 15:05:12,512 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:05:12,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:05:12,512 INFO L85 PathProgramCache]: Analyzing trace with hash -736536282, now seen corresponding path program 1 times [2024-10-12 15:05:12,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:05:12,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664125828] [2024-10-12 15:05:12,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:05:12,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:05:12,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:05:15,600 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:05:15,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:05:15,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664125828] [2024-10-12 15:05:15,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664125828] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:05:15,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705687892] [2024-10-12 15:05:15,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:05:15,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:05:15,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:05:15,603 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) [2024-10-12 15:05:15,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-12 15:05:15,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:05:15,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-10-12 15:05:15,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:05:15,718 INFO L378 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 [2024-10-12 15:05:15,727 INFO L378 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 [2024-10-12 15:05:15,767 INFO L378 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 19 treesize of output 18 [2024-10-12 15:05:15,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 15:05:15,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2024-10-12 15:05:15,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 15:05:15,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 15:05:16,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 15:05:16,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 15:05:16,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2024-10-12 15:05:16,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 15:05:16,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2024-10-12 15:05:16,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 15:05:16,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2024-10-12 15:05:16,413 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 15:05:16,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2024-10-12 15:05:16,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 15:05:16,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2024-10-12 15:05:16,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 15:05:16,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2024-10-12 15:05:16,812 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:05:16,812 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:05:24,342 INFO L378 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 390 treesize of output 366 [2024-10-12 15:05:24,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 15:05:24,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33274 treesize of output 30714 [2024-10-12 15:05:24,840 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 0)) (.cse2 (= 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse4 (select (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse11 (= (+ |c_ULTIMATE.start_main_~i~0#1| 1) 0))) (let ((.cse0 (not .cse11)) (.cse1 (forall ((v_arrayElimCell_112 Int)) (let ((.cse21 (+ .cse4 3 v_arrayElimCell_112))) (or (not (= (mod .cse21 .cse21) 0)) (= (mod (+ .cse4 (* 2 v_arrayElimCell_112) 2) .cse21) 0))))) (.cse10 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse9 (not .cse2)) (.cse6 (forall ((v_arrayElimCell_113 Int) (v_arrayElimCell_112 Int)) (let ((.cse20 (+ .cse4 2 v_arrayElimCell_113 v_arrayElimCell_112))) (or (= (mod (+ .cse4 (* 2 v_arrayElimCell_112) v_arrayElimCell_113 1) .cse20) 0) (not (= (mod .cse20 .cse20) 0)))))) (.cse7 (not .cse3)) (.cse12 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (or (and (or .cse0 .cse1) (or (and (or .cse2 (and (or .cse3 (forall ((v_arrayElimCell_113 Int) (v_arrayElimCell_112 Int) (v_arrayElimCell_114 Int)) (let ((.cse5 (+ .cse4 v_arrayElimCell_114 v_arrayElimCell_113 v_arrayElimCell_112 1))) (or (not (= (mod (+ .cse4 v_arrayElimCell_113 v_arrayElimCell_112 (* 2 v_arrayElimCell_114)) .cse5) 0)) (= (mod (+ .cse4 (* 2 v_arrayElimCell_112) v_arrayElimCell_114 v_arrayElimCell_113) .cse5) 0))))) (or .cse6 .cse7))) (or (forall ((v_arrayElimCell_113 Int) (v_arrayElimCell_114 Int)) (let ((.cse8 (+ .cse4 2 v_arrayElimCell_114 v_arrayElimCell_113))) (or (not (= (mod (+ .cse4 v_arrayElimCell_113 (* 2 v_arrayElimCell_114) 1) .cse8) 0)) (= (mod .cse8 .cse8) 0)))) .cse9)) .cse10 .cse11)) .cse12) (or (let ((.cse13 (forall ((v_arrayElimCell_114 Int)) (= (let ((.cse18 (+ .cse4 3 v_arrayElimCell_114))) (mod .cse18 .cse18)) 0)))) (and (or .cse0 .cse13 .cse1) (or .cse10 (and (or (forall ((v_arrayElimCell_113 Int) (v_arrayElimCell_114 Int)) (let ((.cse15 (+ .cse4 2 v_arrayElimCell_114 v_arrayElimCell_113))) (or (= (let ((.cse14 (+ .cse4 3 v_arrayElimCell_114))) (mod .cse14 .cse14)) 0) (not (= (mod (+ .cse4 v_arrayElimCell_113 (* 2 v_arrayElimCell_114) 1) .cse15) 0)) (= (mod .cse15 .cse15) 0)))) .cse9) (or .cse2 (and (or .cse6 .cse13 .cse7) (or .cse3 (forall ((v_arrayElimCell_113 Int) (v_arrayElimCell_112 Int) (v_arrayElimCell_114 Int)) (let ((.cse16 (+ .cse4 v_arrayElimCell_114 v_arrayElimCell_113 v_arrayElimCell_112 1))) (or (not (= (mod (+ .cse4 v_arrayElimCell_113 v_arrayElimCell_112 (* 2 v_arrayElimCell_114)) .cse16) 0)) (= (let ((.cse17 (+ .cse4 3 v_arrayElimCell_114))) (mod .cse17 .cse17)) 0) (= (mod (+ .cse4 (* 2 v_arrayElimCell_112) v_arrayElimCell_114 v_arrayElimCell_113) .cse16) 0)))))))) .cse11))) .cse12) (or (forall ((v_arrayElimCell_114 Int)) (let ((.cse19 (+ .cse4 3 v_arrayElimCell_114))) (or (= (mod .cse19 .cse19) 0) (not (= (mod (+ .cse4 2 (* 2 v_arrayElimCell_114)) .cse19) 0))))) (not .cse12))))) is different from false [2024-10-12 15:05:24,845 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-10-12 15:05:24,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705687892] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:05:24,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 15:05:24,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 24] total 67 [2024-10-12 15:05:24,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813286535] [2024-10-12 15:05:24,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 15:05:24,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2024-10-12 15:05:24,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:05:24,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2024-10-12 15:05:24,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=3798, Unknown=2, NotChecked=128, Total=4422 [2024-10-12 15:05:24,848 INFO L87 Difference]: Start difference. First operand 100 states and 112 transitions. Second operand has 67 states, 67 states have (on average 1.328358208955224) internal successors, (89), 67 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)