./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/indp4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/indp4.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 5dacb0c2523573165d60080200ebb5b22db90f6a3f4c08906b6192cd2123eb78 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:40:18,084 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:40:18,132 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:40:18,136 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:40:18,136 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:40:18,160 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:40:18,161 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:40:18,161 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:40:18,161 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:40:18,161 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:40:18,162 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:40:18,162 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:40:18,162 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:40:18,162 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:40:18,163 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:40:18,163 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:40:18,163 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:40:18,163 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:40:18,163 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:40:18,163 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:40:18,163 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:40:18,163 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:40:18,163 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:40:18,163 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:40:18,163 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:40:18,163 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:40:18,163 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:40:18,163 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:40:18,163 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:40:18,164 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:40:18,164 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:40:18,164 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:40:18,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:40:18,164 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:40:18,164 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:40:18,164 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:40:18,164 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:40:18,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:40:18,164 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:40:18,164 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:40:18,164 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:40:18,164 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:40:18,164 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:40:18,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:40:18,164 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:40:18,164 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:40:18,165 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:40:18,165 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:40:18,165 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-jdk21/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 -> 5dacb0c2523573165d60080200ebb5b22db90f6a3f4c08906b6192cd2123eb78 [2025-01-08 22:40:18,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:40:18,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:40:18,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:40:18,384 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:40:18,385 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:40:18,386 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/indp4.c [2025-01-08 22:40:19,468 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/913a7e94a/3b1b4512ba45483c95603ca106ee1a62/FLAG77e9b1929 [2025-01-08 22:40:19,740 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:40:19,741 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-fpi/indp4.c [2025-01-08 22:40:19,745 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/913a7e94a/3b1b4512ba45483c95603ca106ee1a62/FLAG77e9b1929 [2025-01-08 22:40:20,036 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/913a7e94a/3b1b4512ba45483c95603ca106ee1a62 [2025-01-08 22:40:20,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:40:20,039 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:40:20,043 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:40:20,043 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:40:20,046 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:40:20,046 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:40:20" (1/1) ... [2025-01-08 22:40:20,047 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1721a114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:40:20, skipping insertion in model container [2025-01-08 22:40:20,047 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:40:20" (1/1) ... [2025-01-08 22:40:20,056 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:40:20,146 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-fpi/indp4.c[588,601] [2025-01-08 22:40:20,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:40:20,168 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:40:20,175 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-fpi/indp4.c[588,601] [2025-01-08 22:40:20,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:40:20,193 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:40:20,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:40:20 WrapperNode [2025-01-08 22:40:20,195 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:40:20,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:40:20,196 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:40:20,196 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:40:20,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:40:20" (1/1) ... [2025-01-08 22:40:20,204 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:40:20" (1/1) ... [2025-01-08 22:40:20,217 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 70 [2025-01-08 22:40:20,218 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:40:20,218 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:40:20,218 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:40:20,218 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:40:20,224 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:40:20" (1/1) ... [2025-01-08 22:40:20,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:40:20" (1/1) ... [2025-01-08 22:40:20,225 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:40:20" (1/1) ... [2025-01-08 22:40:20,235 INFO L175 MemorySlicer]: Split 16 memory accesses to 3 slices as follows [2, 8, 6]. 50 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0]. The 3 writes are split as follows [0, 0, 3]. [2025-01-08 22:40:20,236 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:40:20" (1/1) ... [2025-01-08 22:40:20,236 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:40:20" (1/1) ... [2025-01-08 22:40:20,240 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:40:20" (1/1) ... [2025-01-08 22:40:20,243 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:40:20" (1/1) ... [2025-01-08 22:40:20,245 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:40:20" (1/1) ... [2025-01-08 22:40:20,246 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:40:20" (1/1) ... [2025-01-08 22:40:20,246 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:40:20" (1/1) ... [2025-01-08 22:40:20,247 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:40:20,248 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:40:20,248 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:40:20,248 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:40:20,249 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:40:20" (1/1) ... [2025-01-08 22:40:20,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:40:20,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:40:20,274 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 22:40:20,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 22:40:20,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:40:20,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:40:20,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-08 22:40:20,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-08 22:40:20,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-08 22:40:20,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-08 22:40:20,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-08 22:40:20,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-08 22:40:20,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:40:20,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:40:20,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-08 22:40:20,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-08 22:40:20,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-08 22:40:20,342 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:40:20,344 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:40:20,452 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-01-08 22:40:20,452 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:40:20,457 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:40:20,457 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-08 22:40:20,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:40:20 BoogieIcfgContainer [2025-01-08 22:40:20,458 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:40:20,459 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:40:20,459 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:40:20,462 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:40:20,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:40:20" (1/3) ... [2025-01-08 22:40:20,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da5fb48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:40:20, skipping insertion in model container [2025-01-08 22:40:20,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:40:20" (2/3) ... [2025-01-08 22:40:20,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da5fb48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:40:20, skipping insertion in model container [2025-01-08 22:40:20,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:40:20" (3/3) ... [2025-01-08 22:40:20,464 INFO L128 eAbstractionObserver]: Analyzing ICFG indp4.c [2025-01-08 22:40:20,472 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:40:20,474 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG indp4.c that has 1 procedures, 16 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-01-08 22:40:20,502 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:40:20,508 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;@530f45e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:40:20,508 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:40:20,511 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:40:20,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-08 22:40:20,513 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:40:20,514 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:40:20,514 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:40:20,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:40:20,517 INFO L85 PathProgramCache]: Analyzing trace with hash 354743892, now seen corresponding path program 1 times [2025-01-08 22:40:20,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:40:20,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616154201] [2025-01-08 22:40:20,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:40:20,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:40:20,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-08 22:40:20,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-08 22:40:20,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:40:20,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:40:20,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:40:20,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:40:20,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616154201] [2025-01-08 22:40:20,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616154201] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:40:20,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:40:20,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:40:20,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676096453] [2025-01-08 22:40:20,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:40:20,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-08 22:40:20,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:40:20,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-08 22:40:20,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-08 22:40:20,629 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:40:20,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:40:20,636 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2025-01-08 22:40:20,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-08 22:40:20,637 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-08 22:40:20,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:40:20,641 INFO L225 Difference]: With dead ends: 28 [2025-01-08 22:40:20,641 INFO L226 Difference]: Without dead ends: 13 [2025-01-08 22:40:20,642 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-01-08 22:40:20,644 INFO L435 NwaCegarLoop]: 20 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, 20 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-01-08 22:40:20,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:40:20,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-01-08 22:40:20,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-01-08 22:40:20,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:40:20,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2025-01-08 22:40:20,662 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 11 [2025-01-08 22:40:20,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:40:20,662 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2025-01-08 22:40:20,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:40:20,662 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2025-01-08 22:40:20,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-08 22:40:20,663 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:40:20,663 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:40:20,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:40:20,663 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:40:20,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:40:20,664 INFO L85 PathProgramCache]: Analyzing trace with hash -454602734, now seen corresponding path program 1 times [2025-01-08 22:40:20,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:40:20,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294161685] [2025-01-08 22:40:20,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:40:20,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:40:20,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-08 22:40:20,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-08 22:40:20,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:40:20,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:40:20,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:40:20,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:40:20,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294161685] [2025-01-08 22:40:20,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294161685] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:40:20,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:40:20,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:40:20,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813622961] [2025-01-08 22:40:20,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:40:20,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:40:20,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:40:20,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:40:20,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:40:20,790 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:40:20,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:40:20,837 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2025-01-08 22:40:20,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:40:20,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-08 22:40:20,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:40:20,838 INFO L225 Difference]: With dead ends: 28 [2025-01-08 22:40:20,838 INFO L226 Difference]: Without dead ends: 21 [2025-01-08 22:40:20,838 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-01-08 22:40:20,838 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 23 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:40:20,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 11 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:40:20,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-01-08 22:40:20,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2025-01-08 22:40:20,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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-01-08 22:40:20,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2025-01-08 22:40:20,842 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 11 [2025-01-08 22:40:20,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:40:20,842 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2025-01-08 22:40:20,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:40:20,842 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2025-01-08 22:40:20,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-08 22:40:20,842 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:40:20,842 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:40:20,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:40:20,843 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:40:20,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:40:20,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1904886874, now seen corresponding path program 1 times [2025-01-08 22:40:20,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:40:20,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336438670] [2025-01-08 22:40:20,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:40:20,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:40:20,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-08 22:40:20,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-08 22:40:20,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:40:20,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-08 22:40:20,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [173822845] [2025-01-08 22:40:20,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:40:20,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:40:20,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:40:20,886 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:40:20,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 22:40:20,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-08 22:40:20,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-08 22:40:20,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:40:20,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:40:20,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-08 22:40:20,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:40:20,975 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-01-08 22:40:21,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-08 22:40:21,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-08 22:40:21,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:40:21,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:40:21,323 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 56 treesize of output 52 [2025-01-08 22:40:21,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:40:21,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 101 [2025-01-08 22:40:21,373 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-01-08 22:40:21,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 46 [2025-01-08 22:40:21,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:40:21,398 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 25 treesize of output 25 [2025-01-08 22:40:21,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:40:21,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:40:21,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336438670] [2025-01-08 22:40:21,407 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-08 22:40:21,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173822845] [2025-01-08 22:40:21,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173822845] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:40:21,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:40:21,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2025-01-08 22:40:21,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175092939] [2025-01-08 22:40:21,407 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-08 22:40:21,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-08 22:40:21,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:40:21,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-08 22:40:21,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-08 22:40:21,408 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-01-08 22:40:21,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:40:21,501 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2025-01-08 22:40:21,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:40:21,502 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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 14 [2025-01-08 22:40:21,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:40:21,502 INFO L225 Difference]: With dead ends: 44 [2025-01-08 22:40:21,502 INFO L226 Difference]: Without dead ends: 42 [2025-01-08 22:40:21,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-01-08 22:40:21,503 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 27 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:40:21,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 49 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:40:21,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-01-08 22:40:21,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 26. [2025-01-08 22:40:21,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.4) internal successors, (35), 25 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-01-08 22:40:21,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2025-01-08 22:40:21,507 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 14 [2025-01-08 22:40:21,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:40:21,507 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2025-01-08 22:40:21,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-01-08 22:40:21,507 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2025-01-08 22:40:21,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-08 22:40:21,507 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:40:21,507 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:40:21,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-08 22:40:21,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:40:21,712 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:40:21,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:40:21,712 INFO L85 PathProgramCache]: Analyzing trace with hash 513526682, now seen corresponding path program 2 times [2025-01-08 22:40:21,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:40:21,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262545536] [2025-01-08 22:40:21,713 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:40:21,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:40:21,720 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-08 22:40:21,769 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-01-08 22:40:21,769 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:40:21,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:40:21,953 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-08 22:40:21,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:40:21,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262545536] [2025-01-08 22:40:21,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262545536] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:40:21,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811022336] [2025-01-08 22:40:21,954 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:40:21,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:40:21,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:40:21,956 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:40:21,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 22:40:21,988 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-08 22:40:22,006 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-01-08 22:40:22,006 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:40:22,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:40:22,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-08 22:40:22,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:40:22,046 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-08 22:40:22,046 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:40:22,092 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-08 22:40:22,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811022336] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:40:22,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:40:22,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-01-08 22:40:22,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689516816] [2025-01-08 22:40:22,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:40:22,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-08 22:40:22,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:40:22,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-08 22:40:22,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-01-08 22:40:22,094 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:40:22,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:40:22,294 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2025-01-08 22:40:22,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-08 22:40:22,294 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-01-08 22:40:22,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:40:22,295 INFO L225 Difference]: With dead ends: 68 [2025-01-08 22:40:22,295 INFO L226 Difference]: Without dead ends: 56 [2025-01-08 22:40:22,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2025-01-08 22:40:22,297 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 73 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:40:22,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 67 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:40:22,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-01-08 22:40:22,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 34. [2025-01-08 22:40:22,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:40:22,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2025-01-08 22:40:22,303 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 16 [2025-01-08 22:40:22,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:40:22,303 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2025-01-08 22:40:22,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:40:22,304 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2025-01-08 22:40:22,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-08 22:40:22,304 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:40:22,304 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:40:22,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-08 22:40:22,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:40:22,508 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:40:22,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:40:22,508 INFO L85 PathProgramCache]: Analyzing trace with hash 877206298, now seen corresponding path program 3 times [2025-01-08 22:40:22,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:40:22,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417133944] [2025-01-08 22:40:22,508 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:40:22,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:40:22,516 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 3 equivalence classes. [2025-01-08 22:40:22,548 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 16 of 16 statements. [2025-01-08 22:40:22,548 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-08 22:40:22,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:40:22,654 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-08 22:40:22,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:40:22,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417133944] [2025-01-08 22:40:22,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417133944] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:40:22,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887650652] [2025-01-08 22:40:22,654 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:40:22,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:40:22,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:40:22,656 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:40:22,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-08 22:40:22,705 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 3 equivalence classes. [2025-01-08 22:40:22,727 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 16 of 16 statements. [2025-01-08 22:40:22,727 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-08 22:40:22,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:40:22,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-08 22:40:22,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:40:22,772 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-08 22:40:22,772 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:40:22,815 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-08 22:40:22,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887650652] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:40:22,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:40:22,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 15 [2025-01-08 22:40:22,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010645022] [2025-01-08 22:40:22,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:40:22,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-08 22:40:22,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:40:22,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-08 22:40:22,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-01-08 22:40:22,816 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:40:22,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:40:22,939 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2025-01-08 22:40:22,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-08 22:40:22,939 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-01-08 22:40:22,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:40:22,940 INFO L225 Difference]: With dead ends: 76 [2025-01-08 22:40:22,940 INFO L226 Difference]: Without dead ends: 50 [2025-01-08 22:40:22,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2025-01-08 22:40:22,941 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 68 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:40:22,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 53 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:40:22,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-08 22:40:22,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 33. [2025-01-08 22:40:22,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:40:22,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2025-01-08 22:40:22,945 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 16 [2025-01-08 22:40:22,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:40:22,945 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2025-01-08 22:40:22,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:40:22,945 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2025-01-08 22:40:22,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-08 22:40:22,946 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:40:22,946 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:40:22,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-08 22:40:23,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:40:23,150 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:40:23,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:40:23,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1870068058, now seen corresponding path program 4 times [2025-01-08 22:40:23,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:40:23,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844116963] [2025-01-08 22:40:23,150 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:40:23,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:40:23,165 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-01-08 22:40:23,204 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-08 22:40:23,204 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-08 22:40:23,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-08 22:40:23,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2062173354] [2025-01-08 22:40:23,205 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:40:23,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:40:23,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:40:23,207 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:40:23,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-08 22:40:23,244 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-01-08 22:40:23,283 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-08 22:40:23,283 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-08 22:40:23,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:40:23,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-01-08 22:40:23,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:40:23,300 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-01-08 22:40:23,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-01-08 22:40:23,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:40:23,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-01-08 22:40:23,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:40:23,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 35 [2025-01-08 22:40:23,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:40:23,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 26 [2025-01-08 22:40:23,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 14 [2025-01-08 22:40:23,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:40:23,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2025-01-08 22:40:23,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:40:23,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2025-01-08 22:40:23,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:40:23,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 14 [2025-01-08 22:40:23,528 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:40:23,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:40:43,827 WARN L286 SmtUtils]: Spent 16.02s on a formula simplification. DAG size of input: 19 DAG size of output: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-08 22:41:12,459 WARN L286 SmtUtils]: Spent 24.13s on a formula simplification. DAG size of input: 69 DAG size of output: 68 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-08 22:41:23,029 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296))) (let ((.cse0 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse5 (+ (* .cse6 8) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse1 (or (= (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (< .cse6 2147483648))) (.cse2 (select .cse3 .cse5)) (.cse4 (* .cse0 8))) (and (or (< 2147483647 .cse0) (and .cse1 (forall ((v_ArrVal_122 Int) (v_DerPreprocessor_6 Int)) (or (< .cse2 (+ v_ArrVal_122 |c_ULTIMATE.start_main_~i~0#1| 1)) (= (select (store (store .cse3 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) v_DerPreprocessor_6) .cse5 v_ArrVal_122) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (or (and .cse1 (forall ((v_ArrVal_122 Int) (v_DerPreprocessor_5 Int)) (or (< .cse2 (+ v_ArrVal_122 |c_ULTIMATE.start_main_~i~0#1| 1)) (= (select (store (store .cse3 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_DerPreprocessor_5) .cse5 v_ArrVal_122) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (< .cse0 2147483648)))))) is different from false [2025-01-08 22:41:51,229 WARN L286 SmtUtils]: Spent 16.03s on a formula simplification. DAG size of input: 19 DAG size of output: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-08 22:41:53,295 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296)) (.cse14 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))) (let ((.cse9 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse2 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse7 (+ (* 8 .cse14) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse11 (* .cse12 8))) (let ((.cse0 (< 2147483647 .cse12)) (.cse6 (+ .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (select .cse2 .cse7)) (.cse8 (or (< .cse14 2147483648) (= (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (.cse4 (* (- 1) |c_ULTIMATE.start_main_~i~0#1|)) (.cse5 (* .cse9 8))) (and (or (and (or .cse0 (forall ((v_ArrVal_122 Int) (v_DerPreprocessor_6 Int)) (or (< .cse1 (+ v_ArrVal_122 2 |c_ULTIMATE.start_main_~i~0#1|)) (= 1 (select (store (store (let ((.cse3 (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) .cse4))) .cse6 v_DerPreprocessor_6) .cse7 v_ArrVal_122) |c_ULTIMATE.start_main_~a~0#1.offset|))))) .cse8) (< 2147483647 .cse9)) (or (let ((.cse10 (let ((.cse13 (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)))) (store .cse2 .cse13 (+ (select .cse2 .cse13) .cse4))))) (and (or .cse0 (and (forall ((v_ArrVal_122 Int) (v_DerPreprocessor_6 Int)) (or (< .cse1 (+ v_ArrVal_122 2 |c_ULTIMATE.start_main_~i~0#1|)) (= (select (store (store .cse10 .cse6 v_DerPreprocessor_6) .cse7 v_ArrVal_122) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) .cse8)) (or (and (forall ((v_ArrVal_122 Int) (v_DerPreprocessor_5 Int)) (or (< .cse1 (+ v_ArrVal_122 2 |c_ULTIMATE.start_main_~i~0#1|)) (= (select (store (store .cse10 (+ .cse11 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_DerPreprocessor_5) .cse7 v_ArrVal_122) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) .cse8) (< .cse12 2147483648)))) (< .cse9 2147483648)))))) is different from false [2025-01-08 22:41:57,504 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 56 treesize of output 52 [2025-01-08 22:41:57,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:41:57,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 101 [2025-01-08 22:41:57,617 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-01-08 22:41:57,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 302 treesize of output 262 [2025-01-08 22:41:57,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:41:57,674 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 108 treesize of output 108 [2025-01-08 22:41:57,799 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2025-01-08 22:41:57,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:41:57,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844116963] [2025-01-08 22:41:57,800 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-08 22:41:57,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062173354] [2025-01-08 22:41:57,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062173354] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:41:57,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:41:57,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 27 [2025-01-08 22:41:57,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613928456] [2025-01-08 22:41:57,801 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-08 22:41:57,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-08 22:41:57,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:41:57,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-08 22:41:57,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=466, Unknown=5, NotChecked=94, Total=702 [2025-01-08 22:41:57,802 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 27 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)