./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-properties/list-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-properties/list-2.i -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 a135e953d64ed0fec81eb2a1e42f4031e3e387fc71d5a5cd2177772a202dc706 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:22:04,371 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:22:04,426 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:22:04,430 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:22:04,431 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:22:04,451 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:22:04,452 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:22:04,452 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:22:04,452 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:22:04,452 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:22:04,453 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:22:04,453 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:22:04,453 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:22:04,453 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:22:04,454 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:22:04,454 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:22:04,454 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:22:04,454 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:22:04,454 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:22:04,454 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:22:04,455 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:22:04,455 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:22:04,455 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:22:04,455 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:22:04,455 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:22:04,455 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:22:04,455 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:22:04,455 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:22:04,455 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:22:04,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:22:04,455 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:22:04,456 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:22:04,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:22:04,456 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:22:04,456 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:22:04,456 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:22:04,456 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:22:04,456 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:22:04,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:22:04,456 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:22:04,456 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:22:04,456 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:22:04,456 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:22:04,456 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> a135e953d64ed0fec81eb2a1e42f4031e3e387fc71d5a5cd2177772a202dc706 [2025-03-03 13:22:04,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:22:04,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:22:04,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:22:04,662 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:22:04,662 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:22:04,662 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list-2.i [2025-03-03 13:22:05,760 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c05056e1d/6aa7e9e7fcc5424eacc984aac36c571b/FLAG20ad90e67 [2025-03-03 13:22:06,041 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:22:06,044 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-2.i [2025-03-03 13:22:06,056 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c05056e1d/6aa7e9e7fcc5424eacc984aac36c571b/FLAG20ad90e67 [2025-03-03 13:22:06,072 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c05056e1d/6aa7e9e7fcc5424eacc984aac36c571b [2025-03-03 13:22:06,074 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:22:06,076 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:22:06,077 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:22:06,077 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:22:06,080 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:22:06,081 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:22:06" (1/1) ... [2025-03-03 13:22:06,082 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ba7706c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:06, skipping insertion in model container [2025-03-03 13:22:06,082 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:22:06" (1/1) ... [2025-03-03 13:22:06,108 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:22:06,295 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-2.i[23408,23421] [2025-03-03 13:22:06,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:22:06,306 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:22:06,333 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-2.i[23408,23421] [2025-03-03 13:22:06,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:22:06,352 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:22:06,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:06 WrapperNode [2025-03-03 13:22:06,353 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:22:06,353 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:22:06,353 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:22:06,354 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:22:06,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:06" (1/1) ... [2025-03-03 13:22:06,364 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:06" (1/1) ... [2025-03-03 13:22:06,374 INFO L138 Inliner]: procedures = 124, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 76 [2025-03-03 13:22:06,375 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:22:06,375 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:22:06,375 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:22:06,376 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:22:06,386 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:06" (1/1) ... [2025-03-03 13:22:06,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:06" (1/1) ... [2025-03-03 13:22:06,388 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:06" (1/1) ... [2025-03-03 13:22:06,397 INFO L175 MemorySlicer]: Split 14 memory accesses to 2 slices as follows [2, 12]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2025-03-03 13:22:06,398 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:06" (1/1) ... [2025-03-03 13:22:06,398 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:06" (1/1) ... [2025-03-03 13:22:06,402 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:06" (1/1) ... [2025-03-03 13:22:06,403 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:06" (1/1) ... [2025-03-03 13:22:06,404 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:06" (1/1) ... [2025-03-03 13:22:06,404 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:06" (1/1) ... [2025-03-03 13:22:06,405 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:22:06,407 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:22:06,407 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:22:06,407 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:22:06,408 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:06" (1/1) ... [2025-03-03 13:22:06,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:22:06,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:22:06,430 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) [2025-03-03 13:22:06,432 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 [2025-03-03 13:22:06,446 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-03-03 13:22:06,446 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-03-03 13:22:06,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 13:22:06,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 13:22:06,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 13:22:06,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 13:22:06,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-03 13:22:06,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:22:06,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-03 13:22:06,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-03 13:22:06,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-03 13:22:06,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-03 13:22:06,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:22:06,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 13:22:06,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:22:06,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:22:06,522 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:22:06,523 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:22:06,538 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-03-03 13:22:06,678 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-03 13:22:06,678 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:22:06,684 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:22:06,686 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:22:06,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:22:06 BoogieIcfgContainer [2025-03-03 13:22:06,686 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:22:06,687 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:22:06,688 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:22:06,691 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:22:06,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:22:06" (1/3) ... [2025-03-03 13:22:06,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@150108d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:22:06, skipping insertion in model container [2025-03-03 13:22:06,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:22:06" (2/3) ... [2025-03-03 13:22:06,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@150108d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:22:06, skipping insertion in model container [2025-03-03 13:22:06,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:22:06" (3/3) ... [2025-03-03 13:22:06,692 INFO L128 eAbstractionObserver]: Analyzing ICFG list-2.i [2025-03-03 13:22:06,702 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:22:06,703 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG list-2.i that has 2 procedures, 31 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-03 13:22:06,735 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:22:06,743 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;@45879cc2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:22:06,743 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:22:06,746 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 28 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:22:06,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-03 13:22:06,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:22:06,750 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:22:06,751 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:22:06,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:22:06,755 INFO L85 PathProgramCache]: Analyzing trace with hash -665835477, now seen corresponding path program 1 times [2025-03-03 13:22:06,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:22:06,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686189785] [2025-03-03 13:22:06,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:22:06,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:22:06,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-03 13:22:06,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-03 13:22:06,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:22:06,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:06,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:22:06,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:22:06,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686189785] [2025-03-03 13:22:06,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686189785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:22:06,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:22:06,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 13:22:06,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911383377] [2025-03-03 13:22:06,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:22:06,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 13:22:06,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:22:06,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 13:22:06,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 13:22:06,903 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 28 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:22:06,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:22:06,915 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2025-03-03 13:22:06,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 13:22:06,917 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2025-03-03 13:22:06,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:22:06,921 INFO L225 Difference]: With dead ends: 50 [2025-03-03 13:22:06,921 INFO L226 Difference]: Without dead ends: 21 [2025-03-03 13:22:06,924 INFO L434 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 [2025-03-03 13:22:06,927 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:22:06,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:22:06,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-03 13:22:06,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-03 13:22:06,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:22:06,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2025-03-03 13:22:06,950 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 12 [2025-03-03 13:22:06,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:22:06,951 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2025-03-03 13:22:06,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:22:06,952 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2025-03-03 13:22:06,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 13:22:06,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:22:06,953 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:22:06,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 13:22:06,953 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:22:06,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:22:06,954 INFO L85 PathProgramCache]: Analyzing trace with hash -638901489, now seen corresponding path program 1 times [2025-03-03 13:22:06,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:22:06,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330689154] [2025-03-03 13:22:06,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:22:06,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:22:06,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 13:22:06,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 13:22:06,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:22:06,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:07,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:22:07,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:22:07,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330689154] [2025-03-03 13:22:07,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330689154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:22:07,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:22:07,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:22:07,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3915380] [2025-03-03 13:22:07,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:22:07,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:22:07,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:22:07,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:22:07,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:22:07,217 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:22:07,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:22:07,303 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2025-03-03 13:22:07,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:22:07,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-03 13:22:07,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:22:07,304 INFO L225 Difference]: With dead ends: 38 [2025-03-03 13:22:07,304 INFO L226 Difference]: Without dead ends: 34 [2025-03-03 13:22:07,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:22:07,305 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:22:07,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 49 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:22:07,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-03 13:22:07,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2025-03-03 13:22:07,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 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) [2025-03-03 13:22:07,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2025-03-03 13:22:07,314 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 16 [2025-03-03 13:22:07,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:22:07,314 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2025-03-03 13:22:07,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:22:07,314 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2025-03-03 13:22:07,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 13:22:07,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:22:07,315 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:22:07,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 13:22:07,315 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:22:07,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:22:07,316 INFO L85 PathProgramCache]: Analyzing trace with hash 229391280, now seen corresponding path program 1 times [2025-03-03 13:22:07,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:22:07,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667406459] [2025-03-03 13:22:07,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:22:07,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:22:07,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 13:22:07,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 13:22:07,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:22:07,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:07,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:22:07,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:22:07,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667406459] [2025-03-03 13:22:07,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667406459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:22:07,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:22:07,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:22:07,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752457302] [2025-03-03 13:22:07,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:22:07,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:22:07,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:22:07,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:22:07,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:22:07,495 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:22:07,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:22:07,554 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2025-03-03 13:22:07,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:22:07,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-03 13:22:07,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:22:07,555 INFO L225 Difference]: With dead ends: 40 [2025-03-03 13:22:07,555 INFO L226 Difference]: Without dead ends: 32 [2025-03-03 13:22:07,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:22:07,556 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:22:07,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 52 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:22:07,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-03 13:22:07,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2025-03-03 13:22:07,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 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) [2025-03-03 13:22:07,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2025-03-03 13:22:07,559 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 18 [2025-03-03 13:22:07,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:22:07,560 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2025-03-03 13:22:07,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:22:07,560 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2025-03-03 13:22:07,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 13:22:07,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:22:07,560 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:22:07,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 13:22:07,560 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:22:07,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:22:07,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1149565136, now seen corresponding path program 1 times [2025-03-03 13:22:07,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:22:07,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967039731] [2025-03-03 13:22:07,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:22:07,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:22:07,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 13:22:07,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 13:22:07,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:22:07,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:07,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:22:07,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:22:07,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967039731] [2025-03-03 13:22:07,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967039731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:22:07,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:22:07,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:22:07,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460314340] [2025-03-03 13:22:07,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:22:07,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:22:07,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:22:07,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:22:07,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:22:07,662 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:22:07,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:22:07,723 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2025-03-03 13:22:07,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:22:07,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-03 13:22:07,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:22:07,726 INFO L225 Difference]: With dead ends: 40 [2025-03-03 13:22:07,726 INFO L226 Difference]: Without dead ends: 29 [2025-03-03 13:22:07,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:22:07,726 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:22:07,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 56 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:22:07,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-03 13:22:07,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2025-03-03 13:22:07,730 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) [2025-03-03 13:22:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-03-03 13:22:07,731 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 18 [2025-03-03 13:22:07,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:22:07,731 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-03-03 13:22:07,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:22:07,731 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2025-03-03 13:22:07,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 13:22:07,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:22:07,732 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:22:07,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 13:22:07,732 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:22:07,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:22:07,732 INFO L85 PathProgramCache]: Analyzing trace with hash 639030891, now seen corresponding path program 1 times [2025-03-03 13:22:07,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:22:07,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110449555] [2025-03-03 13:22:07,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:22:07,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:22:07,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 13:22:07,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 13:22:07,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:22:07,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:07,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:22:07,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:22:07,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110449555] [2025-03-03 13:22:07,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110449555] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:22:07,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553255748] [2025-03-03 13:22:07,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:22:07,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:22:07,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:22:07,994 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) [2025-03-03 13:22:07,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 13:22:08,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 13:22:08,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 13:22:08,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:22:08,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:08,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-03 13:22:08,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:22:08,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-03 13:22:08,153 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 [2025-03-03 13:22:08,170 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-03 13:22:08,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-03 13:22:08,215 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 27 treesize of output 11 [2025-03-03 13:22:08,240 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 16 treesize of output 11 [2025-03-03 13:22:08,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:22:08,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:22:08,278 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_81 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_81) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2025-03-03 13:22:08,305 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_79 (Array Int Int)) (v_ArrVal_81 (Array Int Int))) (or (= 2 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_79) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_81) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_79 .cse0))) v_ArrVal_79)))) is different from false [2025-03-03 13:22:08,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:08,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 74 [2025-03-03 13:22:08,345 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 50 treesize of output 46 [2025-03-03 13:22:08,396 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 5 treesize of output 3 [2025-03-03 13:22:08,426 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 102 treesize of output 98 [2025-03-03 13:22:08,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-03-03 13:22:08,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553255748] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:22:08,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:22:08,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-03-03 13:22:08,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208722332] [2025-03-03 13:22:08,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:22:08,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 13:22:08,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:22:08,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 13:22:08,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=85, Unknown=2, NotChecked=38, Total=156 [2025-03-03 13:22:08,532 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 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) [2025-03-03 13:22:08,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:22:08,665 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2025-03-03 13:22:08,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 13:22:08,665 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 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 20 [2025-03-03 13:22:08,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:22:08,666 INFO L225 Difference]: With dead ends: 42 [2025-03-03 13:22:08,666 INFO L226 Difference]: Without dead ends: 36 [2025-03-03 13:22:08,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=158, Unknown=2, NotChecked=54, Total=272 [2025-03-03 13:22:08,666 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 19 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:22:08,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 112 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 115 Invalid, 0 Unknown, 67 Unchecked, 0.1s Time] [2025-03-03 13:22:08,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-03 13:22:08,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2025-03-03 13:22:08,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 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) [2025-03-03 13:22:08,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2025-03-03 13:22:08,669 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 20 [2025-03-03 13:22:08,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:22:08,669 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2025-03-03 13:22:08,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 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) [2025-03-03 13:22:08,669 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2025-03-03 13:22:08,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 13:22:08,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:22:08,669 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:22:08,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 13:22:08,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:22:08,874 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:22:08,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:22:08,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1988370667, now seen corresponding path program 1 times [2025-03-03 13:22:08,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:22:08,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862199838] [2025-03-03 13:22:08,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:22:08,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:22:08,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 13:22:08,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 13:22:08,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:22:08,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:09,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:22:09,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:22:09,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862199838] [2025-03-03 13:22:09,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862199838] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:22:09,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489722451] [2025-03-03 13:22:09,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:22:09,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:22:09,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:22:09,113 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) [2025-03-03 13:22:09,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 13:22:09,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 13:22:09,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 13:22:09,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:22:09,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:09,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-03 13:22:09,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:22:09,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-03 13:22:09,195 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-03 13:22:09,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-03 13:22:09,200 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 [2025-03-03 13:22:09,222 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 11 [2025-03-03 13:22:09,249 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 16 treesize of output 11 [2025-03-03 13:22:09,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:22:09,260 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:22:10,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:10,299 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2025-03-03 13:22:10,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:10,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2025-03-03 13:22:10,312 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 9 treesize of output 7 [2025-03-03 13:22:10,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:22:10,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489722451] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:22:10,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:22:10,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2025-03-03 13:22:10,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520148155] [2025-03-03 13:22:10,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:22:10,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 13:22:10,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:22:10,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 13:22:10,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=97, Unknown=6, NotChecked=0, Total=132 [2025-03-03 13:22:10,374 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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) [2025-03-03 13:22:10,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:22:10,607 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2025-03-03 13:22:10,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 13:22:10,607 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-03 13:22:10,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:22:10,608 INFO L225 Difference]: With dead ends: 47 [2025-03-03 13:22:10,609 INFO L226 Difference]: Without dead ends: 43 [2025-03-03 13:22:10,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=66, Invalid=200, Unknown=6, NotChecked=0, Total=272 [2025-03-03 13:22:10,609 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 27 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:22:10,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 106 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:22:10,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-03 13:22:10,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2025-03-03 13:22:10,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:22:10,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2025-03-03 13:22:10,613 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 20 [2025-03-03 13:22:10,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:22:10,613 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2025-03-03 13:22:10,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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) [2025-03-03 13:22:10,613 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2025-03-03 13:22:10,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 13:22:10,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:22:10,614 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:22:10,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 13:22:10,814 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,SelfDestructingSolverStorable5 [2025-03-03 13:22:10,814 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:22:10,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:22:10,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1417194612, now seen corresponding path program 1 times [2025-03-03 13:22:10,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:22:10,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149961221] [2025-03-03 13:22:10,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:22:10,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:22:10,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 13:22:10,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 13:22:10,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:22:10,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:11,112 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:22:11,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:22:11,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149961221] [2025-03-03 13:22:11,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149961221] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:22:11,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954606034] [2025-03-03 13:22:11,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:22:11,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:22:11,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:22:11,115 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) [2025-03-03 13:22:11,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 13:22:11,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 13:22:11,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 13:22:11,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:22:11,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:11,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-03 13:22:11,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:22:11,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-03 13:22:11,251 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-03 13:22:11,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-03 13:22:11,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-03 13:22:11,287 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 19 treesize of output 1 [2025-03-03 13:22:11,328 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-03 13:22:11,328 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 73 [2025-03-03 13:22:11,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2025-03-03 13:22:11,340 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 40 treesize of output 23 [2025-03-03 13:22:11,368 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 39 treesize of output 21 [2025-03-03 13:22:11,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 13:22:11,391 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:22:11,391 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:22:11,422 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 79 treesize of output 57 [2025-03-03 13:22:11,429 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_181 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_183 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2025-03-03 13:22:11,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:11,444 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-03-03 13:22:11,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:11,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2025-03-03 13:22:11,454 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 11 treesize of output 7 [2025-03-03 13:22:11,468 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-03 13:22:11,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2025-03-03 13:22:11,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-03-03 13:22:11,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954606034] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:22:11,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:22:11,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-03 13:22:11,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424629805] [2025-03-03 13:22:11,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:22:11,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 13:22:11,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:22:11,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 13:22:11,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=226, Unknown=1, NotChecked=30, Total=306 [2025-03-03 13:22:11,551 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:22:11,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:22:11,753 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2025-03-03 13:22:11,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 13:22:11,753 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-03 13:22:11,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:22:11,754 INFO L225 Difference]: With dead ends: 66 [2025-03-03 13:22:11,754 INFO L226 Difference]: Without dead ends: 62 [2025-03-03 13:22:11,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=312, Unknown=1, NotChecked=36, Total=420 [2025-03-03 13:22:11,755 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 52 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:22:11,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 131 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 207 Invalid, 0 Unknown, 48 Unchecked, 0.1s Time] [2025-03-03 13:22:11,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-03 13:22:11,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2025-03-03 13:22:11,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 51 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) [2025-03-03 13:22:11,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2025-03-03 13:22:11,764 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 22 [2025-03-03 13:22:11,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:22:11,764 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2025-03-03 13:22:11,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:22:11,765 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2025-03-03 13:22:11,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 13:22:11,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:22:11,765 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:22:11,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 13:22:11,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:22:11,969 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:22:11,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:22:11,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1145142215, now seen corresponding path program 2 times [2025-03-03 13:22:11,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:22:11,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236565390] [2025-03-03 13:22:11,969 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:22:11,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:22:11,977 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-03 13:22:11,989 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 13:22:11,990 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:22:11,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:12,304 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:22:12,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:22:12,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236565390] [2025-03-03 13:22:12,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236565390] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:22:12,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181371540] [2025-03-03 13:22:12,305 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:22:12,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:22:12,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:22:12,307 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) [2025-03-03 13:22:12,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 13:22:12,360 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-03 13:22:12,379 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 13:22:12,379 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:22:12,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:12,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-03 13:22:12,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:22:12,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-03 13:22:12,430 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 [2025-03-03 13:22:12,445 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-03 13:22:12,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-03 13:22:12,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 13:22:12,554 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 16 treesize of output 11 [2025-03-03 13:22:12,575 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-03 13:22:12,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-03 13:22:12,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-03 13:22:12,656 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 16 treesize of output 11 [2025-03-03 13:22:12,694 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:22:12,694 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:22:12,746 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (= 2 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2025-03-03 13:22:12,789 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_260 (Array Int Int)) (v_ArrVal_263 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_26| Int) (v_ArrVal_264 (Array Int Int))) (or (not (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_260 .cse0))) v_ArrVal_260)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_26| v_ArrVal_264) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_26|) 0)))) is different from false [2025-03-03 13:22:12,814 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:12,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 252 treesize of output 254 [2025-03-03 13:22:12,825 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 55 treesize of output 51 [2025-03-03 13:22:12,837 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 54 treesize of output 46 [2025-03-03 13:22:12,885 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 122 treesize of output 116 [2025-03-03 13:22:12,907 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 5 treesize of output 3 [2025-03-03 13:22:14,189 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-03-03 13:22:14,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181371540] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:22:14,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:22:14,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 25 [2025-03-03 13:22:14,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373561841] [2025-03-03 13:22:14,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:22:14,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 13:22:14,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:22:14,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 13:22:14,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=417, Unknown=7, NotChecked=86, Total=600 [2025-03-03 13:22:14,191 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 25 states, 25 states have (on average 2.28) internal successors, (57), 25 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:22:14,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:22:14,458 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2025-03-03 13:22:14,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 13:22:14,459 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.28) internal successors, (57), 25 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-03 13:22:14,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:22:14,459 INFO L225 Difference]: With dead ends: 62 [2025-03-03 13:22:14,459 INFO L226 Difference]: Without dead ends: 56 [2025-03-03 13:22:14,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=135, Invalid=566, Unknown=9, NotChecked=102, Total=812 [2025-03-03 13:22:14,460 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 23 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 15 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:22:14,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 156 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 200 Invalid, 2 Unknown, 79 Unchecked, 0.1s Time] [2025-03-03 13:22:14,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-03 13:22:14,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2025-03-03 13:22:14,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 53 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:22:14,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2025-03-03 13:22:14,464 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 24 [2025-03-03 13:22:14,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:22:14,466 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2025-03-03 13:22:14,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.28) internal successors, (57), 25 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:22:14,466 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2025-03-03 13:22:14,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 13:22:14,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:22:14,467 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:22:14,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 13:22:14,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:22:14,667 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:22:14,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:22:14,668 INFO L85 PathProgramCache]: Analyzing trace with hash -385990419, now seen corresponding path program 1 times [2025-03-03 13:22:14,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:22:14,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874191593] [2025-03-03 13:22:14,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:22:14,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:22:14,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 13:22:14,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 13:22:14,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:22:14,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:14,871 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:22:14,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:22:14,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874191593] [2025-03-03 13:22:14,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874191593] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:22:14,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185805662] [2025-03-03 13:22:14,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:22:14,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:22:14,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:22:14,874 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) [2025-03-03 13:22:14,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 13:22:14,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 13:22:14,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 13:22:14,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:22:14,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:14,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-03 13:22:14,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:22:14,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-03 13:22:14,987 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-03 13:22:14,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-03 13:22:15,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-03 13:22:15,019 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 19 treesize of output 1 [2025-03-03 13:22:15,049 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-03 13:22:15,049 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 73 [2025-03-03 13:22:15,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2025-03-03 13:22:15,055 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 40 treesize of output 23 [2025-03-03 13:22:15,085 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 39 treesize of output 21 [2025-03-03 13:22:15,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 13:22:15,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:22:15,094 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:22:15,141 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 52 treesize of output 30 [2025-03-03 13:22:15,146 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_314 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_314) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_312 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_312) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)))) is different from false [2025-03-03 13:22:15,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:15,158 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-03-03 13:22:15,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:15,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2025-03-03 13:22:15,169 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 7 treesize of output 3 [2025-03-03 13:22:15,181 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-03 13:22:15,182 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2025-03-03 13:22:15,255 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-03-03 13:22:15,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185805662] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:22:15,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:22:15,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-03 13:22:15,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170572700] [2025-03-03 13:22:15,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:22:15,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 13:22:15,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:22:15,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 13:22:15,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=290, Unknown=1, NotChecked=34, Total=380 [2025-03-03 13:22:15,256 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:22:15,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:22:15,522 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2025-03-03 13:22:15,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 13:22:15,523 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-03 13:22:15,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:22:15,523 INFO L225 Difference]: With dead ends: 70 [2025-03-03 13:22:15,523 INFO L226 Difference]: Without dead ends: 60 [2025-03-03 13:22:15,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=541, Unknown=1, NotChecked=48, Total=702 [2025-03-03 13:22:15,524 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 55 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:22:15,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 196 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 277 Invalid, 0 Unknown, 45 Unchecked, 0.1s Time] [2025-03-03 13:22:15,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-03 13:22:15,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 49. [2025-03-03 13:22:15,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 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) [2025-03-03 13:22:15,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2025-03-03 13:22:15,529 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 24 [2025-03-03 13:22:15,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:22:15,529 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2025-03-03 13:22:15,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:22:15,529 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2025-03-03 13:22:15,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 13:22:15,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:22:15,530 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:22:15,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 13:22:15,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:22:15,734 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:22:15,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:22:15,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1764946835, now seen corresponding path program 2 times [2025-03-03 13:22:15,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:22:15,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726377688] [2025-03-03 13:22:15,734 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:22:15,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:22:15,745 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-03 13:22:15,752 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 13:22:15,753 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:22:15,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:15,954 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:22:15,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:22:15,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726377688] [2025-03-03 13:22:15,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726377688] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:22:15,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517321044] [2025-03-03 13:22:15,955 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:22:15,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:22:15,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:22:15,958 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) [2025-03-03 13:22:15,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 13:22:16,003 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-03 13:22:16,016 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 13:22:16,017 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:22:16,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:16,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-03 13:22:16,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:22:16,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-03 13:22:16,053 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-03 13:22:16,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-03 13:22:16,070 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 1 [2025-03-03 13:22:16,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 13:22:16,101 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-03 13:22:16,101 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 57 [2025-03-03 13:22:16,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-03 13:22:16,106 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 32 treesize of output 19 [2025-03-03 13:22:16,128 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 31 treesize of output 19 [2025-03-03 13:22:16,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 11 [2025-03-03 13:22:16,135 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:22:16,135 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:22:16,165 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 52 treesize of output 30 [2025-03-03 13:22:16,169 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_363 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_363) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_362 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_362) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2025-03-03 13:22:16,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:16,182 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-03-03 13:22:16,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:16,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2025-03-03 13:22:16,195 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 7 treesize of output 3 [2025-03-03 13:22:16,199 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-03 13:22:16,200 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2025-03-03 13:22:16,271 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-03-03 13:22:16,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517321044] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:22:16,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:22:16,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-03-03 13:22:16,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996826658] [2025-03-03 13:22:16,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:22:16,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 13:22:16,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:22:16,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 13:22:16,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=201, Unknown=1, NotChecked=28, Total=272 [2025-03-03 13:22:16,273 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:22:16,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:22:16,452 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2025-03-03 13:22:16,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 13:22:16,464 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-03 13:22:16,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:22:16,465 INFO L225 Difference]: With dead ends: 65 [2025-03-03 13:22:16,465 INFO L226 Difference]: Without dead ends: 52 [2025-03-03 13:22:16,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=380, Unknown=1, NotChecked=40, Total=506 [2025-03-03 13:22:16,465 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 32 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:22:16,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 160 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 193 Invalid, 0 Unknown, 39 Unchecked, 0.1s Time] [2025-03-03 13:22:16,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-03 13:22:16,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2025-03-03 13:22:16,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:22:16,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2025-03-03 13:22:16,468 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 24 [2025-03-03 13:22:16,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:22:16,469 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2025-03-03 13:22:16,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:22:16,469 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2025-03-03 13:22:16,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 13:22:16,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:22:16,469 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:22:16,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 13:22:16,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:22:16,671 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:22:16,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:22:16,671 INFO L85 PathProgramCache]: Analyzing trace with hash -375516696, now seen corresponding path program 3 times [2025-03-03 13:22:16,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:22:16,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586046916] [2025-03-03 13:22:16,671 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:22:16,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:22:16,678 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-03-03 13:22:16,686 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 13:22:16,686 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 13:22:16,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:17,081 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:22:17,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:22:17,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586046916] [2025-03-03 13:22:17,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586046916] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:22:17,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190070091] [2025-03-03 13:22:17,082 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:22:17,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:22:17,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:22:17,084 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) [2025-03-03 13:22:17,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 13:22:17,137 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-03-03 13:22:17,158 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 13:22:17,158 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 13:22:17,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:17,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-03 13:22:17,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:22:17,227 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 1 [2025-03-03 13:22:17,233 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 [2025-03-03 13:22:17,267 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-03 13:22:17,268 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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-03 13:22:17,270 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 5 treesize of output 3 [2025-03-03 13:22:17,285 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-03 13:22:17,285 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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-03 13:22:17,292 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 [2025-03-03 13:22:17,355 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-03-03 13:22:17,355 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 1 case distinctions, treesize of input 23 treesize of output 26 [2025-03-03 13:22:17,370 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-03-03 13:22:17,370 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 1 case distinctions, treesize of input 27 treesize of output 19 [2025-03-03 13:22:17,374 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 23 treesize of output 11 [2025-03-03 13:22:17,494 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2025-03-03 13:22:17,495 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 84 [2025-03-03 13:22:17,522 INFO L349 Elim1Store]: treesize reduction 28, result has 54.1 percent of original size [2025-03-03 13:22:17,523 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 3 case distinctions, treesize of input 61 treesize of output 77 [2025-03-03 13:22:17,555 INFO L349 Elim1Store]: treesize reduction 28, result has 56.9 percent of original size [2025-03-03 13:22:17,555 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 3 case distinctions, treesize of input 56 treesize of output 78 [2025-03-03 13:22:17,762 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 15 treesize of output 11 [2025-03-03 13:22:17,795 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 41 treesize of output 33 [2025-03-03 13:22:17,911 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-03 13:22:17,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 56 [2025-03-03 13:22:17,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 37 [2025-03-03 13:22:18,074 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:22:18,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:22:18,407 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:18,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 98 [2025-03-03 13:22:18,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:18,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1585 treesize of output 1559 [2025-03-03 13:22:18,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:18,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 599 treesize of output 557 [2025-03-03 13:22:18,604 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 6 treesize of output 4 [2025-03-03 13:22:18,612 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 6 treesize of output 4 [2025-03-03 13:22:18,780 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 81 treesize of output 27 [2025-03-03 13:22:18,812 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 81 treesize of output 27 [2025-03-03 13:22:18,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:18,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 75 [2025-03-03 13:22:19,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:19,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 73 [2025-03-03 13:22:19,178 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 10 treesize of output 8 [2025-03-03 13:22:19,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:19,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 149 [2025-03-03 13:22:19,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:19,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2898 treesize of output 2766 [2025-03-03 13:22:20,670 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 74 treesize of output 54 [2025-03-03 13:22:20,674 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 22 treesize of output 10 [2025-03-03 13:22:20,831 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 8 treesize of output 4 [2025-03-03 13:22:20,849 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 8 treesize of output 4 [2025-03-03 13:22:20,877 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 8 treesize of output 4 [2025-03-03 13:22:21,026 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 8 treesize of output 4 [2025-03-03 13:22:21,077 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 8 treesize of output 4 [2025-03-03 13:22:21,117 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse7 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse35 (not .cse7)) (.cse13 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse45 (forall ((v_ArrVal_447 (Array Int Int)) (v_arrayElimArr_8 (Array Int Int))) (let ((.cse55 (select v_arrayElimArr_8 .cse4))) (let ((.cse54 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse55 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse54 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse55 .cse54) (= .cse54 |c_ULTIMATE.start_main_~a~0#1.base|))))))) (and (or (and (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((v_arrayElimArr_8 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_8 .cse4))) (or (forall ((v_ArrVal_447 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse0 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse0 .cse1) (= .cse1 |c_ULTIMATE.start_main_~a~0#1.base|)))) (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_445 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) .cse0 v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse3 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse3 .cse4))))))) (not (= (select v_arrayElimArr_9 .cse4) 0)))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((v_arrayElimArr_8 (Array Int Int))) (let ((.cse5 (select v_arrayElimArr_8 .cse4))) (or (forall ((v_ArrVal_447 (Array Int Int))) (let ((.cse6 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse5 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse5 .cse6) (= .cse6 |c_ULTIMATE.start_main_~a~0#1.base|)))) (= .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_445 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) .cse5 v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (select v_arrayElimArr_9 .cse4) 0))))) .cse7) (or (and (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_445 (Array Int Int))) (let ((.cse8 (select v_arrayElimArr_8 .cse4))) (let ((.cse10 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) .cse8 v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_ArrVal_447 (Array Int Int))) (let ((.cse9 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse8 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse8 .cse9) (= .cse9 |c_ULTIMATE.start_main_~a~0#1.base|)))) (= .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse10 |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (select v_arrayElimArr_9 .cse4) 0)))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse4) 0)) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_445 (Array Int Int))) (let ((.cse11 (select v_arrayElimArr_8 .cse4))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) .cse11 v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (forall ((v_ArrVal_447 (Array Int Int))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse11 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse12 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse11 .cse12) (= .cse12 |c_ULTIMATE.start_main_~a~0#1.base|)))))))))) .cse13) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse4) 0)) (forall ((v_arrayElimArr_8 (Array Int Int))) (let ((.cse14 (select v_arrayElimArr_8 .cse4))) (or (forall ((v_ArrVal_447 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse14 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse14 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse14 |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_445 (Array Int Int))) (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) .cse14 v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse15 0) (= .cse15 |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse4) 0)) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_445 (Array Int Int))) (let ((.cse16 (select v_arrayElimArr_8 .cse4))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) .cse16 v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse16 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse16 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse17 0) (forall ((v_ArrVal_447 (Array Int Int))) (let ((.cse18 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse16 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (select .cse18 .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.base| (select .cse18 4))))))))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse4) 0)) (forall ((v_arrayElimArr_8 (Array Int Int))) (let ((.cse19 (select v_arrayElimArr_8 .cse4))) (or (forall ((v_ArrVal_445 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) .cse19 v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= .cse19 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_447 (Array Int Int))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse19 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse20 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse19 .cse20) (= .cse20 |c_ULTIMATE.start_main_~a~0#1.base|))))))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((v_arrayElimArr_8 (Array Int Int))) (let ((.cse21 (select v_arrayElimArr_8 .cse4))) (or (= .cse21 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse21 |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_445 (Array Int Int))) (let ((.cse22 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) .cse21 v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse22 0)))) (forall ((v_ArrVal_447 (Array Int Int))) (let ((.cse23 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse21 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse23 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse23 |c_ULTIMATE.start_main_~a~0#1.base|))))))) (not (= (select v_arrayElimArr_9 .cse4) 0)))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse4) 0)) (forall ((v_ArrVal_447 (Array Int Int)) (v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_445 (Array Int Int))) (let ((.cse24 (select v_arrayElimArr_8 .cse4))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) .cse24 v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse24 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse25 0) (= .cse25 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= .cse24 |c_ULTIMATE.start_main_~p~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse24 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|))))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse4) 0)) (forall ((v_ArrVal_447 (Array Int Int)) (v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_445 (Array Int Int))) (let ((.cse27 (select v_arrayElimArr_8 .cse4))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse27 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse26 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse27 |c_ULTIMATE.start_main_~a~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) .cse27 v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0) (not (= .cse27 |c_ULTIMATE.start_main_~p~0#1.base|)) (= .cse26 |c_ULTIMATE.start_main_~a~0#1.base|))))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((v_arrayElimArr_8 (Array Int Int))) (let ((.cse28 (select v_arrayElimArr_8 .cse4))) (or (forall ((v_ArrVal_447 (Array Int Int))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse28 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse28 .cse29) (= .cse29 |c_ULTIMATE.start_main_~a~0#1.base|)))) (= .cse28 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_445 (Array Int Int))) (let ((.cse30 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) .cse28 v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse30 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse30 |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (not (= (select v_arrayElimArr_9 .cse4) 0)))) (or .cse13 (forall ((v_ArrVal_447 (Array Int Int)) (v_arrayElimArr_8 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int)) (v_ArrVal_445 (Array Int Int))) (let ((.cse31 (select v_arrayElimArr_8 .cse4))) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse31 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) .cse31 v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse32 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_9 .cse4) 0)) (= .cse31 .cse32)))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse4) 0)) (forall ((v_ArrVal_447 (Array Int Int)) (v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_445 (Array Int Int))) (let ((.cse34 (select v_arrayElimArr_8 .cse4))) (let ((.cse33 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse34 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse33 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse34 |c_ULTIMATE.start_main_~a~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) .cse34 v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0) (= .cse33 |c_ULTIMATE.start_main_~a~0#1.base|))))))) (or (and .cse35 (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((v_arrayElimArr_8 (Array Int Int))) (let ((.cse36 (select v_arrayElimArr_8 .cse4))) (or (not (= .cse36 |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_447 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse36 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_445 (Array Int Int))) (let ((.cse37 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) .cse36 v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse37 0)))) (not (= .cse36 |c_ULTIMATE.start_main_~a~0#1.base|))))) (not (= (select v_arrayElimArr_9 .cse4) 0))))) .cse13) (or (forall ((v_ArrVal_447 (Array Int Int)) (v_arrayElimArr_8 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int)) (v_ArrVal_445 (Array Int Int))) (let ((.cse38 (select v_arrayElimArr_8 .cse4))) (let ((.cse39 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) .cse38 v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse38 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse38 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_9 .cse4) 0)) (= .cse39 0))))) .cse13) (or .cse13 (and (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse4) 0)) (forall ((v_ArrVal_447 (Array Int Int)) (v_arrayElimArr_8 (Array Int Int))) (let ((.cse40 (select v_arrayElimArr_8 .cse4))) (let ((.cse41 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse40 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse40 .cse41) (= .cse41 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_445 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) .cse40 v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|)))))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse4) 0)) (forall ((v_ArrVal_447 (Array Int Int)) (v_arrayElimArr_8 (Array Int Int))) (let ((.cse42 (select v_arrayElimArr_8 .cse4))) (let ((.cse43 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse42 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse42 .cse43) (= .cse43 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_445 (Array Int Int))) (let ((.cse44 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) .cse42 v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse44 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse44 .cse4)))))))))) .cse45)) (or (and (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse4) 0)) (forall ((v_arrayElimArr_8 (Array Int Int))) (let ((.cse46 (select v_arrayElimArr_8 .cse4))) (or (forall ((v_ArrVal_445 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) .cse46 v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= .cse46 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_447 (Array Int Int))) (let ((.cse47 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse46 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse47 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse46 .cse47))))))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse4) 0)) (forall ((v_arrayElimArr_8 (Array Int Int))) (let ((.cse48 (select v_arrayElimArr_8 .cse4))) (or (= .cse48 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_445 (Array Int Int))) (let ((.cse49 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) .cse48 v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse49 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse49 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_447 (Array Int Int))) (= .cse48 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse48 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))))) .cse35) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((v_ArrVal_447 (Array Int Int)) (v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_445 (Array Int Int))) (let ((.cse50 (select v_arrayElimArr_8 .cse4))) (let ((.cse51 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse50 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) .cse50 v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse51 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse50 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse50 .cse51))))) (not (= (select v_arrayElimArr_9 .cse4) 0)))) (or .cse13 .cse45) (forall ((v_ArrVal_447 (Array Int Int)) (v_arrayElimArr_8 (Array Int Int))) (let ((.cse53 (select v_arrayElimArr_8 .cse4))) (let ((.cse52 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse53 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse52 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse53 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse53 .cse52) (= .cse52 |c_ULTIMATE.start_main_~a~0#1.base|)))))))) is different from false [2025-03-03 13:22:21,499 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse7 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse35 (not .cse7)) (.cse13 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse43 (forall ((v_ArrVal_447 (Array Int Int)) (v_arrayElimArr_8 (Array Int Int))) (let ((.cse53 (select v_arrayElimArr_8 .cse4))) (let ((.cse52 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse53 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse52 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse53 .cse52) (= .cse52 |c_ULTIMATE.start_main_~a~0#1.base|))))))) (and (or (and (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((v_arrayElimArr_8 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_8 .cse4))) (or (forall ((v_ArrVal_447 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse0 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse0 .cse1) (= .cse1 |c_ULTIMATE.start_main_~a~0#1.base|)))) (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_445 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) .cse0 v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse3 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse3 .cse4))))))) (not (= (select v_arrayElimArr_9 .cse4) 0)))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((v_arrayElimArr_8 (Array Int Int))) (let ((.cse5 (select v_arrayElimArr_8 .cse4))) (or (forall ((v_ArrVal_447 (Array Int Int))) (let ((.cse6 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse5 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse5 .cse6) (= .cse6 |c_ULTIMATE.start_main_~a~0#1.base|)))) (= .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_445 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) .cse5 v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (select v_arrayElimArr_9 .cse4) 0))))) .cse7) (or (and (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_445 (Array Int Int))) (let ((.cse8 (select v_arrayElimArr_8 .cse4))) (let ((.cse10 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) .cse8 v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_ArrVal_447 (Array Int Int))) (let ((.cse9 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse8 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse8 .cse9) (= .cse9 |c_ULTIMATE.start_main_~a~0#1.base|)))) (= .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse10 |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (select v_arrayElimArr_9 .cse4) 0)))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse4) 0)) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_445 (Array Int Int))) (let ((.cse11 (select v_arrayElimArr_8 .cse4))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) .cse11 v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (forall ((v_ArrVal_447 (Array Int Int))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse11 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse12 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse11 .cse12) (= .cse12 |c_ULTIMATE.start_main_~a~0#1.base|)))))))))) .cse13) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse4) 0)) (forall ((v_arrayElimArr_8 (Array Int Int))) (let ((.cse14 (select v_arrayElimArr_8 .cse4))) (or (forall ((v_ArrVal_447 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse14 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse14 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse14 |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_445 (Array Int Int))) (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) .cse14 v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse15 0) (= .cse15 |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse4) 0)) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_445 (Array Int Int))) (let ((.cse16 (select v_arrayElimArr_8 .cse4))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) .cse16 v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse16 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse16 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse17 0) (forall ((v_ArrVal_447 (Array Int Int))) (let ((.cse18 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse16 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (select .cse18 .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.base| (select .cse18 4))))))))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse4) 0)) (forall ((v_arrayElimArr_8 (Array Int Int))) (let ((.cse19 (select v_arrayElimArr_8 .cse4))) (or (forall ((v_ArrVal_445 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) .cse19 v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= .cse19 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_447 (Array Int Int))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse19 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse20 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse19 .cse20) (= .cse20 |c_ULTIMATE.start_main_~a~0#1.base|))))))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((v_arrayElimArr_8 (Array Int Int))) (let ((.cse21 (select v_arrayElimArr_8 .cse4))) (or (= .cse21 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse21 |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_445 (Array Int Int))) (let ((.cse22 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) .cse21 v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse22 0)))) (forall ((v_ArrVal_447 (Array Int Int))) (let ((.cse23 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse21 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse23 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse23 |c_ULTIMATE.start_main_~a~0#1.base|))))))) (not (= (select v_arrayElimArr_9 .cse4) 0)))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse4) 0)) (forall ((v_ArrVal_447 (Array Int Int)) (v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_445 (Array Int Int))) (let ((.cse24 (select v_arrayElimArr_8 .cse4))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) .cse24 v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse24 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse25 0) (= .cse25 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= .cse24 |c_ULTIMATE.start_main_~p~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse24 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|))))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse4) 0)) (forall ((v_ArrVal_447 (Array Int Int)) (v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_445 (Array Int Int))) (let ((.cse27 (select v_arrayElimArr_8 .cse4))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse27 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse26 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse27 |c_ULTIMATE.start_main_~a~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) .cse27 v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0) (not (= .cse27 |c_ULTIMATE.start_main_~p~0#1.base|)) (= .cse26 |c_ULTIMATE.start_main_~a~0#1.base|))))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((v_arrayElimArr_8 (Array Int Int))) (let ((.cse28 (select v_arrayElimArr_8 .cse4))) (or (forall ((v_ArrVal_447 (Array Int Int))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse28 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse28 .cse29) (= .cse29 |c_ULTIMATE.start_main_~a~0#1.base|)))) (= .cse28 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_445 (Array Int Int))) (let ((.cse30 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) .cse28 v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse30 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse30 |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (not (= (select v_arrayElimArr_9 .cse4) 0)))) (or .cse13 (forall ((v_ArrVal_447 (Array Int Int)) (v_arrayElimArr_8 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int)) (v_ArrVal_445 (Array Int Int))) (let ((.cse31 (select v_arrayElimArr_8 .cse4))) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse31 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) .cse31 v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse32 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_9 .cse4) 0)) (= .cse31 .cse32)))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse4) 0)) (forall ((v_ArrVal_447 (Array Int Int)) (v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_445 (Array Int Int))) (let ((.cse34 (select v_arrayElimArr_8 .cse4))) (let ((.cse33 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse34 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse33 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse34 |c_ULTIMATE.start_main_~a~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) .cse34 v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0) (= .cse33 |c_ULTIMATE.start_main_~a~0#1.base|))))))) (or .cse35 .cse13) (or (forall ((v_ArrVal_447 (Array Int Int)) (v_arrayElimArr_8 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int)) (v_ArrVal_445 (Array Int Int))) (let ((.cse36 (select v_arrayElimArr_8 .cse4))) (let ((.cse37 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) .cse36 v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse36 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse36 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_9 .cse4) 0)) (= .cse37 0))))) .cse13) (or .cse13 (and (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse4) 0)) (forall ((v_ArrVal_447 (Array Int Int)) (v_arrayElimArr_8 (Array Int Int))) (let ((.cse38 (select v_arrayElimArr_8 .cse4))) (let ((.cse39 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse38 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse38 .cse39) (= .cse39 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_445 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) .cse38 v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|)))))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse4) 0)) (forall ((v_ArrVal_447 (Array Int Int)) (v_arrayElimArr_8 (Array Int Int))) (let ((.cse40 (select v_arrayElimArr_8 .cse4))) (let ((.cse41 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse40 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse40 .cse41) (= .cse41 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_445 (Array Int Int))) (let ((.cse42 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) .cse40 v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse42 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse42 .cse4)))))))))) .cse43)) (or (and (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse4) 0)) (forall ((v_arrayElimArr_8 (Array Int Int))) (let ((.cse44 (select v_arrayElimArr_8 .cse4))) (or (forall ((v_ArrVal_445 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) .cse44 v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= .cse44 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_447 (Array Int Int))) (let ((.cse45 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse44 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse45 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse44 .cse45))))))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse4) 0)) (forall ((v_arrayElimArr_8 (Array Int Int))) (let ((.cse46 (select v_arrayElimArr_8 .cse4))) (or (= .cse46 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_445 (Array Int Int))) (let ((.cse47 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) .cse46 v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse47 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse47 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_447 (Array Int Int))) (= .cse46 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse46 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))))) .cse35) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((v_ArrVal_447 (Array Int Int)) (v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_445 (Array Int Int))) (let ((.cse48 (select v_arrayElimArr_8 .cse4))) (let ((.cse49 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse48 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) .cse48 v_ArrVal_445) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse49 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse48 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse48 .cse49))))) (not (= (select v_arrayElimArr_9 .cse4) 0)))) (or .cse13 .cse43) (forall ((v_ArrVal_447 (Array Int Int)) (v_arrayElimArr_8 (Array Int Int))) (let ((.cse51 (select v_arrayElimArr_8 .cse4))) (let ((.cse50 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) .cse51 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse50 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse51 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse51 .cse50) (= .cse50 |c_ULTIMATE.start_main_~a~0#1.base|)))))))) is different from false [2025-03-03 13:22:21,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:21,617 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 45 [2025-03-03 13:22:21,622 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:21,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2025-03-03 13:22:21,625 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 13:22:21,626 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 21 treesize of output 15 [2025-03-03 13:22:21,633 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-03 13:22:21,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 14 [2025-03-03 13:22:21,635 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 13:22:21,636 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 20 treesize of output 14 [2025-03-03 13:22:21,638 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 13:22:21,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2025-03-03 13:22:21,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:21,641 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 58 [2025-03-03 13:22:21,642 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 13:22:21,649 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-03-03 13:22:21,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 55 [2025-03-03 13:22:21,653 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 5 treesize of output 3 [2025-03-03 13:22:21,656 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-03 13:22:21,660 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-03 13:22:21,660 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 1 [2025-03-03 13:22:21,663 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-03 13:22:21,665 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-03 13:22:21,669 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-03 13:22:21,670 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 1 [2025-03-03 13:22:21,676 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-03 13:22:21,676 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 190 treesize of output 1 [2025-03-03 13:22:21,678 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-03 13:22:21,681 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-03 13:22:21,687 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-03 13:22:21,687 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 1 [2025-03-03 13:22:21,707 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 2 times theorem prover too weak. 0 trivial. 4 not checked. [2025-03-03 13:22:21,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190070091] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:22:21,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:22:21,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 15] total 33 [2025-03-03 13:22:21,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409978404] [2025-03-03 13:22:21,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:22:21,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-03 13:22:21,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:22:21,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-03 13:22:21,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=804, Unknown=12, NotChecked=118, Total=1056 [2025-03-03 13:22:21,708 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:22:23,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:22:23,380 INFO L93 Difference]: Finished difference Result 99 states and 117 transitions. [2025-03-03 13:22:23,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-03 13:22:23,381 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-03 13:22:23,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:22:23,381 INFO L225 Difference]: With dead ends: 99 [2025-03-03 13:22:23,382 INFO L226 Difference]: Without dead ends: 90 [2025-03-03 13:22:23,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=336, Invalid=2307, Unknown=17, NotChecked=202, Total=2862 [2025-03-03 13:22:23,383 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 76 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 37 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 13:22:23,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 245 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 481 Invalid, 3 Unknown, 152 Unchecked, 0.4s Time] [2025-03-03 13:22:23,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-03 13:22:23,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2025-03-03 13:22:23,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.1948051948051948) internal successors, (92), 77 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) [2025-03-03 13:22:23,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2025-03-03 13:22:23,391 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 26 [2025-03-03 13:22:23,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:22:23,391 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2025-03-03 13:22:23,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:22:23,391 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2025-03-03 13:22:23,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 13:22:23,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:22:23,392 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:22:23,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 13:22:23,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:22:23,593 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:22:23,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:22:23,593 INFO L85 PathProgramCache]: Analyzing trace with hash -960843544, now seen corresponding path program 1 times [2025-03-03 13:22:23,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:22:23,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789109023] [2025-03-03 13:22:23,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:22:23,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:22:23,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 13:22:23,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 13:22:23,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:22:23,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 13:22:23,607 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 13:22:23,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 13:22:23,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 13:22:23,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:22:23,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 13:22:23,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 13:22:23,628 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 13:22:23,628 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 13:22:23,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 13:22:23,631 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:22:23,647 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 13:22:23,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 01:22:23 BoogieIcfgContainer [2025-03-03 13:22:23,649 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 13:22:23,650 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 13:22:23,650 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 13:22:23,650 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 13:22:23,651 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:22:06" (3/4) ... [2025-03-03 13:22:23,651 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-03 13:22:23,689 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 19. [2025-03-03 13:22:23,736 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 13:22:23,736 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 13:22:23,736 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 13:22:23,737 INFO L158 Benchmark]: Toolchain (without parser) took 17661.60ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 109.5MB in the beginning and 240.5MB in the end (delta: -131.0MB). Peak memory consumption was 147.5MB. Max. memory is 16.1GB. [2025-03-03 13:22:23,737 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory was 125.6MB in the beginning and 125.3MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:22:23,737 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.34ms. Allocated memory is still 142.6MB. Free memory was 109.5MB in the beginning and 92.4MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 13:22:23,737 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.60ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 90.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:22:23,737 INFO L158 Benchmark]: Boogie Preprocessor took 29.93ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 89.3MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 13:22:23,738 INFO L158 Benchmark]: IcfgBuilder took 278.76ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 74.5MB in the end (delta: 14.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 13:22:23,738 INFO L158 Benchmark]: TraceAbstraction took 16961.94ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 74.5MB in the beginning and 244.8MB in the end (delta: -170.3MB). Peak memory consumption was 105.6MB. Max. memory is 16.1GB. [2025-03-03 13:22:23,738 INFO L158 Benchmark]: Witness Printer took 86.69ms. Allocated memory is still 419.4MB. Free memory was 244.8MB in the beginning and 240.5MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 13:22:23,740 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory was 125.6MB in the beginning and 125.3MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.34ms. Allocated memory is still 142.6MB. Free memory was 109.5MB in the beginning and 92.4MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.60ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 90.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.93ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 89.3MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 278.76ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 74.5MB in the end (delta: 14.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 16961.94ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 74.5MB in the beginning and 244.8MB in the end (delta: -170.3MB). Peak memory consumption was 105.6MB. Max. memory is 16.1GB. * Witness Printer took 86.69ms. Allocated memory is still 419.4MB. Free memory was 244.8MB in the beginning and 240.5MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 557]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L532] List a = (List) malloc(sizeof(struct node)); [L533] COND FALSE !(a == 0) VAL [a={-1:0}] [L534] List t; [L535] List p = a; VAL [a={-1:0}, p={-1:0}] [L536] COND TRUE __VERIFIER_nondet_int() [L536] COND TRUE __VERIFIER_nondet_int() [L537] p->h = 1 [L538] t = (List) malloc(sizeof(struct node)) [L539] COND FALSE !(t == 0) VAL [a={-1:0}, p={-1:0}, t={-2:0}] [L540] p->n = t [L541] EXPR p->n [L541] p = p->n [L536] COND TRUE __VERIFIER_nondet_int() [L536] COND FALSE !(__VERIFIER_nondet_int()) [L543] COND TRUE __VERIFIER_nondet_int() [L543] COND TRUE __VERIFIER_nondet_int() [L544] p->h = 2 [L545] t = (List) malloc(sizeof(struct node)) [L546] COND FALSE !(t == 0) VAL [a={-1:0}, p={-2:0}, t={-3:0}] [L547] p->n = t [L548] EXPR p->n [L548] p = p->n [L543] COND TRUE __VERIFIER_nondet_int() [L543] COND FALSE !(__VERIFIER_nondet_int()) [L550] p->h = 3 [L551] p = a VAL [p={-1:0}] [L552] COND TRUE p->h == 2 [L552] EXPR p->h [L552] COND FALSE !(p->h == 2) [L554] COND TRUE p->h == 1 [L554] EXPR p->h [L554] COND TRUE p->h == 1 [L555] EXPR p->n [L555] p = p->n VAL [p={-2:0}] [L554] COND TRUE p->h == 1 [L554] EXPR p->h [L554] COND FALSE !(p->h == 1) [L556] EXPR p->h [L556] COND TRUE p->h != 3 [L557] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.9s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 298 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 298 mSDsluCounter, 1299 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 430 IncrementalHoareTripleChecker+Unchecked, 1099 mSDsCounter, 132 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1747 IncrementalHoareTripleChecker+Invalid, 2314 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 132 mSolverCounterUnsat, 200 mSDtfsCounter, 1747 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 448 GetRequests, 256 SyntacticMatches, 7 SemanticMatches, 185 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1015 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=11, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 59 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 11.3s InterpolantComputationTime, 410 NumberOfCodeBlocks, 410 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 519 ConstructedInterpolants, 66 QuantifiedInterpolants, 10683 SizeOfPredicates, 46 NumberOfNonLiveVariables, 944 ConjunctsInSsa, 274 ConjunctsInUnsatCore, 25 InterpolantComputations, 4 PerfectInterpolantSequences, 22/124 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-03 13:22:23,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE