./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/ifcomp.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/array-fpi/ifcomp.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0d2a65255d8b2e6b68882339bb2639d8ae744f5b340e0d3d33c067476b0c9dc7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 13:54:47,073 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 13:54:47,123 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 13:54:47,126 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 13:54:47,126 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 13:54:47,149 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 13:54:47,150 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 13:54:47,150 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 13:54:47,150 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 13:54:47,151 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 13:54:47,151 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 13:54:47,151 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 13:54:47,151 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 13:54:47,152 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 13:54:47,152 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 13:54:47,152 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 13:54:47,152 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 13:54:47,152 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 13:54:47,152 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 13:54:47,152 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 13:54:47,152 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 13:54:47,152 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 13:54:47,152 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 13:54:47,152 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 13:54:47,152 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 13:54:47,152 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 13:54:47,152 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 13:54:47,152 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 13:54:47,152 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 13:54:47,152 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 13:54:47,152 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 13:54:47,152 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 13:54:47,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 13:54:47,153 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 13:54:47,153 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 13:54:47,153 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 13:54:47,153 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 13:54:47,153 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 13:54:47,153 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 13:54:47,153 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 13:54:47,153 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 13:54:47,153 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 13:54:47,153 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 13:54:47,153 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 -> 0d2a65255d8b2e6b68882339bb2639d8ae744f5b340e0d3d33c067476b0c9dc7 [2025-03-16 13:54:47,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 13:54:47,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 13:54:47,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 13:54:47,397 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 13:54:47,397 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 13:54:47,399 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/ifcomp.c [2025-03-16 13:54:48,485 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0d39dd16/56b935edaac84a0dbc11088eb89d2935/FLAGa14cdbefd [2025-03-16 13:54:48,672 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 13:54:48,673 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ifcomp.c [2025-03-16 13:54:48,678 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0d39dd16/56b935edaac84a0dbc11088eb89d2935/FLAGa14cdbefd [2025-03-16 13:54:49,041 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0d39dd16/56b935edaac84a0dbc11088eb89d2935 [2025-03-16 13:54:49,043 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 13:54:49,044 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 13:54:49,045 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 13:54:49,045 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 13:54:49,048 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 13:54:49,049 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 01:54:49" (1/1) ... [2025-03-16 13:54:49,049 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7237b30b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:54:49, skipping insertion in model container [2025-03-16 13:54:49,049 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 01:54:49" (1/1) ... [2025-03-16 13:54:49,062 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 13:54:49,151 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/array-fpi/ifcomp.c[589,602] [2025-03-16 13:54:49,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 13:54:49,173 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 13:54:49,179 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/array-fpi/ifcomp.c[589,602] [2025-03-16 13:54:49,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 13:54:49,196 INFO L204 MainTranslator]: Completed translation [2025-03-16 13:54:49,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:54:49 WrapperNode [2025-03-16 13:54:49,198 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 13:54:49,198 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 13:54:49,199 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 13:54:49,199 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 13:54:49,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:54:49" (1/1) ... [2025-03-16 13:54:49,208 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:54:49" (1/1) ... [2025-03-16 13:54:49,221 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 80 [2025-03-16 13:54:49,222 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 13:54:49,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 13:54:49,222 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 13:54:49,222 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 13:54:49,227 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:54:49" (1/1) ... [2025-03-16 13:54:49,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:54:49" (1/1) ... [2025-03-16 13:54:49,229 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:54:49" (1/1) ... [2025-03-16 13:54:49,236 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 6 writes are split as follows [0, 2, 2, 2]. [2025-03-16 13:54:49,236 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:54:49" (1/1) ... [2025-03-16 13:54:49,236 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:54:49" (1/1) ... [2025-03-16 13:54:49,239 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:54:49" (1/1) ... [2025-03-16 13:54:49,240 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:54:49" (1/1) ... [2025-03-16 13:54:49,240 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:54:49" (1/1) ... [2025-03-16 13:54:49,241 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:54:49" (1/1) ... [2025-03-16 13:54:49,242 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 13:54:49,243 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 13:54:49,243 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 13:54:49,243 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 13:54:49,244 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:54:49" (1/1) ... [2025-03-16 13:54:49,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 13:54:49,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:54:49,264 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-16 13:54:49,266 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-16 13:54:49,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 13:54:49,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 13:54:49,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 13:54:49,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 13:54:49,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-16 13:54:49,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 13:54:49,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 13:54:49,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-16 13:54:49,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-16 13:54:49,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-16 13:54:49,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 13:54:49,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 13:54:49,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 13:54:49,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 13:54:49,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-16 13:54:49,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-16 13:54:49,338 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 13:54:49,339 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 13:54:49,454 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-16 13:54:49,455 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 13:54:49,460 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 13:54:49,460 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 13:54:49,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 01:54:49 BoogieIcfgContainer [2025-03-16 13:54:49,461 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 13:54:49,462 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 13:54:49,463 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 13:54:49,465 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 13:54:49,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 01:54:49" (1/3) ... [2025-03-16 13:54:49,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22615028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 01:54:49, skipping insertion in model container [2025-03-16 13:54:49,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:54:49" (2/3) ... [2025-03-16 13:54:49,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22615028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 01:54:49, skipping insertion in model container [2025-03-16 13:54:49,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 01:54:49" (3/3) ... [2025-03-16 13:54:49,467 INFO L128 eAbstractionObserver]: Analyzing ICFG ifcomp.c [2025-03-16 13:54:49,476 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 13:54:49,477 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ifcomp.c that has 1 procedures, 21 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-16 13:54:49,508 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 13:54:49,515 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;@1e0dd210, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 13:54:49,515 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 13:54:49,518 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:54:49,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-16 13:54:49,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:54:49,522 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:54:49,522 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:54:49,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:54:49,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1311034008, now seen corresponding path program 1 times [2025-03-16 13:54:49,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:54:49,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374400481] [2025-03-16 13:54:49,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:54:49,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:54:49,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-16 13:54:49,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-16 13:54:49,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:54:49,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:54:49,637 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-16 13:54:49,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:54:49,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374400481] [2025-03-16 13:54:49,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374400481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:54:49,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 13:54:49,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 13:54:49,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670536663] [2025-03-16 13:54:49,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:54:49,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 13:54:49,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:54:49,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 13:54:49,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 13:54:49,658 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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-16 13:54:49,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:54:49,668 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2025-03-16 13:54:49,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 13:54:49,669 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2025-03-16 13:54:49,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:54:49,673 INFO L225 Difference]: With dead ends: 39 [2025-03-16 13:54:49,673 INFO L226 Difference]: Without dead ends: 18 [2025-03-16 13:54:49,676 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-16 13:54:49,678 INFO L435 NwaCegarLoop]: 28 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, 28 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-16 13:54:49,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:54:49,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-16 13:54:49,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-16 13:54:49,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 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-16 13:54:49,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2025-03-16 13:54:49,706 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 10 [2025-03-16 13:54:49,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:54:49,707 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2025-03-16 13:54:49,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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-16 13:54:49,707 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2025-03-16 13:54:49,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-16 13:54:49,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:54:49,708 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:54:49,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 13:54:49,710 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:54:49,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:54:49,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1241122953, now seen corresponding path program 1 times [2025-03-16 13:54:49,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:54:49,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420831069] [2025-03-16 13:54:49,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:54:49,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:54:49,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-16 13:54:49,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-16 13:54:49,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:54:49,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:54:49,871 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-16 13:54:49,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:54:49,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420831069] [2025-03-16 13:54:49,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420831069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:54:49,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 13:54:49,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 13:54:49,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143467127] [2025-03-16 13:54:49,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:54:49,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 13:54:49,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:54:49,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 13:54:49,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 13:54:49,873 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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-16 13:54:49,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:54:49,943 INFO L93 Difference]: Finished difference Result 46 states and 64 transitions. [2025-03-16 13:54:49,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 13:54:49,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2025-03-16 13:54:49,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:54:49,944 INFO L225 Difference]: With dead ends: 46 [2025-03-16 13:54:49,944 INFO L226 Difference]: Without dead ends: 32 [2025-03-16 13:54:49,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 13:54:49,945 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 44 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 13:54:49,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 13 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 13:54:49,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-16 13:54:49,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2025-03-16 13:54:49,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:54:49,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2025-03-16 13:54:49,950 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 10 [2025-03-16 13:54:49,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:54:49,950 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2025-03-16 13:54:49,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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-16 13:54:49,950 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2025-03-16 13:54:49,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 13:54:49,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:54:49,950 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:54:49,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 13:54:49,953 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:54:49,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:54:49,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1843376722, now seen corresponding path program 1 times [2025-03-16 13:54:49,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:54:49,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235863123] [2025-03-16 13:54:49,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:54:49,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:54:49,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-16 13:54:50,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 13:54:50,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:54:50,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 13:54:50,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1347227317] [2025-03-16 13:54:50,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:54:50,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:54:50,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:54:50,008 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-16 13:54:50,009 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-16 13:54:50,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-16 13:54:50,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 13:54:50,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:54:50,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:54:50,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-16 13:54:50,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:54:50,104 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-16 13:54:50,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 13:54:50,152 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 13:54:50,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:54:50,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235863123] [2025-03-16 13:54:50,152 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-16 13:54:50,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347227317] [2025-03-16 13:54:50,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347227317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:54:50,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 13:54:50,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 13:54:50,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582170670] [2025-03-16 13:54:50,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:54:50,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 13:54:50,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:54:50,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 13:54:50,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 13:54:50,153 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:54:50,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:54:50,211 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2025-03-16 13:54:50,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 13:54:50,212 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-16 13:54:50,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:54:50,213 INFO L225 Difference]: With dead ends: 37 [2025-03-16 13:54:50,213 INFO L226 Difference]: Without dead ends: 35 [2025-03-16 13:54:50,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 13:54:50,214 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 9 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:54:50,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 63 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:54:50,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-16 13:54:50,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2025-03-16 13:54:50,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:54:50,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2025-03-16 13:54:50,222 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 19 [2025-03-16 13:54:50,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:54:50,222 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2025-03-16 13:54:50,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:54:50,222 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2025-03-16 13:54:50,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-16 13:54:50,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:54:50,223 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:54:50,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 13:54:50,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:54:50,424 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:54:50,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:54:50,424 INFO L85 PathProgramCache]: Analyzing trace with hash 584950264, now seen corresponding path program 1 times [2025-03-16 13:54:50,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:54:50,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068471054] [2025-03-16 13:54:50,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:54:50,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:54:50,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-16 13:54:50,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-16 13:54:50,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:54:50,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:54:50,559 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 13:54:50,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:54:50,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068471054] [2025-03-16 13:54:50,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068471054] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:54:50,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307709874] [2025-03-16 13:54:50,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:54:50,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:54:50,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:54:50,562 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-16 13:54:50,562 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-16 13:54:50,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-16 13:54:50,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-16 13:54:50,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:54:50,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:54:50,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 13:54:50,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:54:50,677 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 13:54:50,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:54:50,725 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 13:54:50,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307709874] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:54:50,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:54:50,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-16 13:54:50,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938077724] [2025-03-16 13:54:50,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:54:50,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 13:54:50,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:54:50,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 13:54:50,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-16 13:54:50,726 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:54:50,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:54:50,845 INFO L93 Difference]: Finished difference Result 75 states and 94 transitions. [2025-03-16 13:54:50,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 13:54:50,845 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-16 13:54:50,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:54:50,846 INFO L225 Difference]: With dead ends: 75 [2025-03-16 13:54:50,846 INFO L226 Difference]: Without dead ends: 46 [2025-03-16 13:54:50,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-16 13:54:50,847 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 30 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 13:54:50,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 33 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 13:54:50,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-16 13:54:50,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 30. [2025-03-16 13:54:50,850 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-16 13:54:50,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2025-03-16 13:54:50,850 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 22 [2025-03-16 13:54:50,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:54:50,850 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2025-03-16 13:54:50,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:54:50,851 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2025-03-16 13:54:50,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-16 13:54:50,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:54:50,851 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:54:50,857 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-16 13:54:51,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-16 13:54:51,052 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:54:51,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:54:51,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1432241706, now seen corresponding path program 1 times [2025-03-16 13:54:51,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:54:51,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450513798] [2025-03-16 13:54:51,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:54:51,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:54:51,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-16 13:54:51,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-16 13:54:51,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:54:51,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 13:54:51,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1513956932] [2025-03-16 13:54:51,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:54:51,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:54:51,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:54:51,104 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-16 13:54:51,107 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-16 13:54:51,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-16 13:54:51,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-16 13:54:51,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:54:51,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:54:51,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-16 13:54:51,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:54:51,264 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-16 13:54:51,300 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-16 13:54:51,337 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 13:54:51,338 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:54:51,537 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 19 [2025-03-16 13:54:51,555 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 13:54:51,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:54:51,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450513798] [2025-03-16 13:54:51,556 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-16 13:54:51,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513956932] [2025-03-16 13:54:51,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513956932] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:54:51,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 13:54:51,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2025-03-16 13:54:51,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450552929] [2025-03-16 13:54:51,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 13:54:51,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 13:54:51,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:54:51,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 13:54:51,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-16 13:54:51,557 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 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-16 13:54:51,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:54:51,848 INFO L93 Difference]: Finished difference Result 112 states and 138 transitions. [2025-03-16 13:54:51,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 13:54:51,848 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 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) Word has length 28 [2025-03-16 13:54:51,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:54:51,849 INFO L225 Difference]: With dead ends: 112 [2025-03-16 13:54:51,849 INFO L226 Difference]: Without dead ends: 88 [2025-03-16 13:54:51,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2025-03-16 13:54:51,850 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 115 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 13:54:51,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 64 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 13:54:51,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-16 13:54:51,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 43. [2025-03-16 13:54:51,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:54:51,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2025-03-16 13:54:51,857 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 28 [2025-03-16 13:54:51,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:54:51,857 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2025-03-16 13:54:51,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 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-16 13:54:51,857 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2025-03-16 13:54:51,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-16 13:54:51,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:54:51,857 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:54:51,865 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-16 13:54:52,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:54:52,058 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:54:52,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:54:52,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1706673164, now seen corresponding path program 1 times [2025-03-16 13:54:52,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:54:52,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868968802] [2025-03-16 13:54:52,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:54:52,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:54:52,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-16 13:54:52,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-16 13:54:52,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:54:52,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 13:54:52,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1361033782] [2025-03-16 13:54:52,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:54:52,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:54:52,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:54:52,140 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-16 13:54:52,142 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-16 13:54:52,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-16 13:54:52,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-16 13:54:52,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:54:52,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:54:52,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-16 13:54:52,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:54:52,268 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-16 13:54:52,304 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-16 13:54:52,338 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-16 13:54:52,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-16 13:54:52,469 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 13:54:52,469 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:54:52,761 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 48 treesize of output 44 [2025-03-16 13:54:52,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:54:52,772 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 75 treesize of output 73 [2025-03-16 13:54:52,971 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 19 [2025-03-16 13:54:53,001 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 13:54:53,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:54:53,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868968802] [2025-03-16 13:54:53,002 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-16 13:54:53,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361033782] [2025-03-16 13:54:53,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361033782] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:54:53,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 13:54:53,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2025-03-16 13:54:53,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856209298] [2025-03-16 13:54:53,002 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 13:54:53,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-16 13:54:53,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:54:53,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-16 13:54:53,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2025-03-16 13:54:53,003 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand has 23 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 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-16 13:54:54,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:54:54,219 INFO L93 Difference]: Finished difference Result 189 states and 221 transitions. [2025-03-16 13:54:54,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-16 13:54:54,220 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 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 31 [2025-03-16 13:54:54,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:54:54,221 INFO L225 Difference]: With dead ends: 189 [2025-03-16 13:54:54,221 INFO L226 Difference]: Without dead ends: 160 [2025-03-16 13:54:54,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=380, Invalid=1260, Unknown=0, NotChecked=0, Total=1640 [2025-03-16 13:54:54,222 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 505 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 13:54:54,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 129 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 13:54:54,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-16 13:54:54,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 75. [2025-03-16 13:54:54,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.2837837837837838) internal successors, (95), 74 states have internal predecessors, (95), 0 states have call successors, (0), 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-16 13:54:54,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 95 transitions. [2025-03-16 13:54:54,237 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 95 transitions. Word has length 31 [2025-03-16 13:54:54,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:54:54,237 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 95 transitions. [2025-03-16 13:54:54,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 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-16 13:54:54,239 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2025-03-16 13:54:54,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 13:54:54,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:54:54,241 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:54:54,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 13:54:54,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:54:54,444 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:54:54,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:54:54,445 INFO L85 PathProgramCache]: Analyzing trace with hash 323493142, now seen corresponding path program 2 times [2025-03-16 13:54:54,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:54:54,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202205072] [2025-03-16 13:54:54,445 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:54:54,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:54:54,454 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-16 13:54:54,472 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 13:54:54,472 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:54:54,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:54:54,606 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 13:54:54,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:54:54,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202205072] [2025-03-16 13:54:54,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202205072] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:54:54,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144664275] [2025-03-16 13:54:54,607 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:54:54,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:54:54,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:54:54,609 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-16 13:54:54,610 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-16 13:54:54,645 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-16 13:54:54,660 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 13:54:54,660 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:54:54,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:54:54,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 13:54:54,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:54:54,727 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 13:54:54,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:54:54,775 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 13:54:54,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144664275] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:54:54,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:54:54,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-03-16 13:54:54,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64494116] [2025-03-16 13:54:54,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:54:54,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 13:54:54,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:54:54,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 13:54:54,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-16 13:54:54,776 INFO L87 Difference]: Start difference. First operand 75 states and 95 transitions. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:54:54,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:54:54,927 INFO L93 Difference]: Finished difference Result 185 states and 227 transitions. [2025-03-16 13:54:54,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 13:54:54,928 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-16 13:54:54,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:54:54,928 INFO L225 Difference]: With dead ends: 185 [2025-03-16 13:54:54,928 INFO L226 Difference]: Without dead ends: 103 [2025-03-16 13:54:54,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-03-16 13:54:54,929 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 70 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 13:54:54,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 61 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 13:54:54,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-16 13:54:54,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2025-03-16 13:54:54,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 81 states have internal predecessors, (100), 0 states have call successors, (0), 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-16 13:54:54,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2025-03-16 13:54:54,942 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 34 [2025-03-16 13:54:54,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:54:54,943 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2025-03-16 13:54:54,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:54:54,943 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2025-03-16 13:54:54,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 13:54:54,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:54:54,943 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:54:54,952 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-16 13:54:55,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:54:55,144 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:54:55,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:54:55,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1224982549, now seen corresponding path program 3 times [2025-03-16 13:54:55,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:54:55,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553546656] [2025-03-16 13:54:55,144 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:54:55,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:54:55,152 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 6 equivalence classes. [2025-03-16 13:54:55,225 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 37 of 43 statements. [2025-03-16 13:54:55,225 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-16 13:54:55,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:54:55,418 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-16 13:54:55,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:54:55,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553546656] [2025-03-16 13:54:55,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553546656] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:54:55,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91805626] [2025-03-16 13:54:55,418 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:54:55,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:54:55,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:54:55,420 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-16 13:54:55,421 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-16 13:54:55,465 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 6 equivalence classes. [2025-03-16 13:54:55,573 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 37 of 43 statements. [2025-03-16 13:54:55,573 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-16 13:54:55,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:54:55,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 13:54:55,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:54:55,671 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-16 13:54:55,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:54:55,759 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-16 13:54:55,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91805626] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:54:55,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:54:55,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 22 [2025-03-16 13:54:55,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531800113] [2025-03-16 13:54:55,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:54:55,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-16 13:54:55,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:54:55,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-16 13:54:55,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2025-03-16 13:54:55,760 INFO L87 Difference]: Start difference. First operand 82 states and 100 transitions. Second operand has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 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-16 13:54:55,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:54:55,989 INFO L93 Difference]: Finished difference Result 170 states and 206 transitions. [2025-03-16 13:54:55,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 13:54:55,989 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 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 43 [2025-03-16 13:54:55,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:54:55,990 INFO L225 Difference]: With dead ends: 170 [2025-03-16 13:54:55,990 INFO L226 Difference]: Without dead ends: 94 [2025-03-16 13:54:55,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=224, Invalid=706, Unknown=0, NotChecked=0, Total=930 [2025-03-16 13:54:55,991 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 167 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 13:54:55,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 57 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 13:54:55,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-16 13:54:55,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 74. [2025-03-16 13:54:55,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 73 states have internal predecessors, (85), 0 states have call successors, (0), 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-16 13:54:55,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2025-03-16 13:54:55,998 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 43 [2025-03-16 13:54:55,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:54:55,998 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2025-03-16 13:54:55,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 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-16 13:54:55,998 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2025-03-16 13:54:55,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 13:54:55,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:54:55,999 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:54:56,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 13:54:56,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:54:56,199 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:54:56,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:54:56,200 INFO L85 PathProgramCache]: Analyzing trace with hash 828163346, now seen corresponding path program 4 times [2025-03-16 13:54:56,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:54:56,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171796225] [2025-03-16 13:54:56,200 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 13:54:56,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:54:56,214 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-03-16 13:54:56,273 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 13:54:56,273 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-16 13:54:56,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 13:54:56,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [107726959] [2025-03-16 13:54:56,274 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 13:54:56,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:54:56,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:54:56,276 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-16 13:54:56,278 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-16 13:54:56,319 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-03-16 13:54:56,464 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 13:54:56,464 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-16 13:54:56,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:54:56,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-03-16 13:54:56,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:54:56,486 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-16 13:54:56,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-16 13:54:56,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:54:56,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-16 13:54:56,666 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-16 13:54:56,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-16 13:54:56,796 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:54:56,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2025-03-16 13:54:56,849 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-16 13:54:56,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-16 13:54:56,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:54:56,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-16 13:54:57,184 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 5 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 13:54:57,184 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:54:58,629 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 97 treesize of output 91 [2025-03-16 13:54:58,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:54:58,637 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 265 treesize of output 247 [2025-03-16 13:54:58,714 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 112 treesize of output 104 [2025-03-16 13:54:58,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:54:58,721 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 65 treesize of output 52 [2025-03-16 13:54:58,730 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 133 treesize of output 125 [2025-03-16 13:54:58,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:54:58,737 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 368 treesize of output 297 [2025-03-16 13:55:15,192 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296)) (.cse6 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse7 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse18 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296))) (let ((.cse12 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse14 (* .cse18 8)) (.cse0 (= (+ (select .cse7 .cse6) (select .cse7 |c_ULTIMATE.start_main_~b~0#1.offset|)) 8)) (.cse1 (< .cse16 2147483648))) (let ((.cse4 (or .cse0 .cse1)) (.cse2 (< .cse18 2147483648)) (.cse3 (< 2147483647 .cse18)) (.cse8 (+ .cse14 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse11 (+ (* .cse16 8) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse10 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse9 (* 8 .cse12))) (and (or (and (or .cse0 .cse1 .cse2) (or .cse3 (and .cse4 (forall ((v_DerPreprocessor_6 Int)) (= (let ((.cse5 (store (store .cse7 .cse8 (+ (select .cse7 (+ .cse9 |c_ULTIMATE.start_main_~b~0#1.offset|)) (select .cse10 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse9)))) .cse11 v_DerPreprocessor_6))) (+ (select .cse5 .cse6) (select .cse5 |c_ULTIMATE.start_main_~b~0#1.offset|))) 8))))) (< 2147483647 .cse12)) (or (let ((.cse15 (+ (select .cse10 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368) .cse9)) (select .cse7 (+ (- 34359738368) .cse9 |c_ULTIMATE.start_main_~b~0#1.offset|))))) (and (or (and (forall ((v_DerPreprocessor_6 Int)) (= (let ((.cse13 (store (store .cse7 (+ .cse14 (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse15) .cse11 v_DerPreprocessor_6))) (+ (select .cse13 .cse6) (select .cse13 |c_ULTIMATE.start_main_~b~0#1.offset|))) 8)) .cse4) .cse2) (or .cse3 (and (<= .cse16 2147483647) (forall ((v_DerPreprocessor_6 Int)) (= 8 (let ((.cse17 (store (store .cse7 .cse8 .cse15) .cse11 v_DerPreprocessor_6))) (+ (select .cse17 |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse17 .cse6))))))))) (< .cse12 2147483648)))))) is different from false [2025-03-16 13:55:27,620 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296))) (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse2 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse9 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296)) (.cse14 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse3 (* .cse7 8))) (let ((.cse8 (< 2147483647 .cse7)) (.cse11 (+ .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse12 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse13 (* 8 .cse14)) (.cse5 (+ (* .cse9 8) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse6 (or (= (+ (select .cse2 .cse1) (select .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|)) 8) (< .cse9 2147483648)))) (and (or (let ((.cse4 (+ (select .cse12 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368) .cse13)) (select .cse2 (+ (- 34359738368) .cse13 |c_ULTIMATE.start_main_~b~0#1.offset|))))) (and (or (and (forall ((v_DerPreprocessor_6 Int)) (= (let ((.cse0 (store (store .cse2 (+ .cse3 (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse4) .cse5 v_DerPreprocessor_6))) (+ (select .cse0 .cse1) (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|))) 8)) .cse6) (< .cse7 2147483648)) (or .cse8 (and (<= .cse9 2147483647) (forall ((v_DerPreprocessor_6 Int)) (= 8 (let ((.cse10 (store (store .cse2 .cse11 .cse4) .cse5 v_DerPreprocessor_6))) (+ (select .cse10 |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse10 .cse1))))))))) (< .cse14 2147483648)) (or (< 2147483647 .cse14) (and (or .cse8 (forall ((v_DerPreprocessor_6 Int)) (= (let ((.cse15 (store (store .cse2 .cse11 (+ (select .cse2 (+ .cse13 |c_ULTIMATE.start_main_~b~0#1.offset|)) (select .cse12 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse13)))) .cse5 v_DerPreprocessor_6))) (+ (select .cse15 .cse1) (select .cse15 |c_ULTIMATE.start_main_~b~0#1.offset|))) 8))) .cse6)))))) is different from false [2025-03-16 13:55:40,027 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296))) (let ((.cse14 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse10 (* .cse8 8)) (.cse7 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse3 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse11 (or (< .cse7 2147483648) (= (+ (select .cse3 .cse2) (select .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|)) 8))) (.cse4 (+ .cse10 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse13 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse12 (* .cse14 8)) (.cse6 (+ (* 8 .cse7) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse0 (< 2147483647 .cse8))) (and (or (let ((.cse5 (+ (select .cse3 (+ .cse12 (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|)) (select .cse13 (+ .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)))))) (and (or .cse0 (and (forall ((v_DerPreprocessor_6 Int)) (= (let ((.cse1 (store (store .cse3 .cse4 .cse5) .cse6 v_DerPreprocessor_6))) (+ (select .cse1 .cse2) (select .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|))) 8)) (<= .cse7 2147483647))) (or (< .cse8 2147483648) (and (forall ((v_DerPreprocessor_6 Int)) (= (let ((.cse9 (store (store .cse3 (+ .cse10 (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse5) .cse6 v_DerPreprocessor_6))) (+ (select .cse9 .cse2) (select .cse9 |c_ULTIMATE.start_main_~b~0#1.offset|))) 8)) .cse11)))) (< .cse14 2147483648)) (or (and .cse11 (or (forall ((v_DerPreprocessor_6 Int)) (= (let ((.cse15 (store (store .cse3 .cse4 (+ (select .cse3 (+ .cse12 |c_ULTIMATE.start_main_~b~0#1.offset|)) (select .cse13 (+ .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|)))) .cse6 v_DerPreprocessor_6))) (+ (select .cse15 |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse15 .cse2))) 8)) .cse0)) (< 2147483647 .cse14)))))) is different from false [2025-03-16 13:55:40,052 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 9 treesize of output 3 [2025-03-16 13:55:44,067 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 115 treesize of output 107 [2025-03-16 13:55:44,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:55:44,089 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 2798 treesize of output 2504 [2025-03-16 13:55:44,401 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 9 treesize of output 3 [2025-03-16 13:55:44,408 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 121 treesize of output 113 [2025-03-16 13:55:44,414 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 76 treesize of output 68 [2025-03-16 13:55:44,428 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 119 treesize of output 111 [2025-03-16 13:55:44,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:55:44,437 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 497 treesize of output 418 [2025-03-16 13:55:48,536 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296))) (or (< 2147483647 .cse0) (and (= 6 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= .cse0 1)))) (<= (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647) (<= (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2147483647)) is different from false [2025-03-16 13:56:09,294 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-16 13:56:21,371 WARN L286 SmtUtils]: Spent 12.08s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)