./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/pnr5.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-tiling/pnr5.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 c6dc18f387244e600c9c46c5a67fb3c0c9875a9a14eb13d3a621343f4a214b0b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:18:13,354 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:18:13,409 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:18:13,412 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:18:13,412 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:18:13,437 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:18:13,438 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:18:13,438 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:18:13,438 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:18:13,438 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:18:13,439 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:18:13,439 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:18:13,439 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:18:13,439 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:18:13,439 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:18:13,440 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:18:13,440 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:18:13,440 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:18:13,440 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:18:13,440 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:18:13,440 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:18:13,440 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:18:13,440 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:18:13,441 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:18:13,441 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:18:13,441 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:18:13,441 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:18:13,441 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:18:13,441 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:18:13,441 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:18:13,441 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:18:13,442 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:18:13,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:18:13,442 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:18:13,442 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:18:13,442 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:18:13,442 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:18:13,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:18:13,442 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:18:13,442 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:18:13,442 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:18:13,442 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:18:13,442 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:18:13,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:18:13,443 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:18:13,443 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:18:13,443 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:18:13,443 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:18:13,443 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 -> c6dc18f387244e600c9c46c5a67fb3c0c9875a9a14eb13d3a621343f4a214b0b [2025-01-08 22:18:13,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:18:13,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:18:13,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:18:13,675 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:18:13,675 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:18:13,677 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/pnr5.c [2025-01-08 22:18:14,081 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3aa1c7988/f33b2da2125d4cdb8519708778b009f2/FLAG35c125558 [2025-01-08 22:18:15,636 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:18:15,637 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-tiling/pnr5.c [2025-01-08 22:18:15,641 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3aa1c7988/f33b2da2125d4cdb8519708778b009f2/FLAG35c125558 [2025-01-08 22:18:15,651 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3aa1c7988/f33b2da2125d4cdb8519708778b009f2 [2025-01-08 22:18:15,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:18:15,653 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:18:15,654 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:18:15,654 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:18:15,657 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:18:15,657 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:18:15" (1/1) ... [2025-01-08 22:18:15,658 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24bab302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:18:15, skipping insertion in model container [2025-01-08 22:18:15,658 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:18:15" (1/1) ... [2025-01-08 22:18:15,669 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:18:15,771 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-tiling/pnr5.c[395,408] [2025-01-08 22:18:15,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:18:15,806 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:18:15,813 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-tiling/pnr5.c[395,408] [2025-01-08 22:18:15,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:18:15,831 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:18:15,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:18:15 WrapperNode [2025-01-08 22:18:15,832 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:18:15,832 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:18:15,832 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:18:15,832 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:18:15,836 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:18:15" (1/1) ... [2025-01-08 22:18:15,841 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:18:15" (1/1) ... [2025-01-08 22:18:15,853 INFO L138 Inliner]: procedures = 17, calls = 33, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 93 [2025-01-08 22:18:15,854 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:18:15,854 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:18:15,854 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:18:15,854 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:18:15,860 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:18:15" (1/1) ... [2025-01-08 22:18:15,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:18:15" (1/1) ... [2025-01-08 22:18:15,861 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:18:15" (1/1) ... [2025-01-08 22:18:15,869 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 7, 11]. 55 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0]. The 10 writes are split as follows [0, 0, 10]. [2025-01-08 22:18:15,869 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:18:15" (1/1) ... [2025-01-08 22:18:15,870 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:18:15" (1/1) ... [2025-01-08 22:18:15,873 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:18:15" (1/1) ... [2025-01-08 22:18:15,873 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:18:15" (1/1) ... [2025-01-08 22:18:15,875 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:18:15" (1/1) ... [2025-01-08 22:18:15,876 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:18:15" (1/1) ... [2025-01-08 22:18:15,877 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:18:15" (1/1) ... [2025-01-08 22:18:15,878 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:18:15,878 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:18:15,878 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:18:15,878 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:18:15,879 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:18:15" (1/1) ... [2025-01-08 22:18:15,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:18:15,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:18:15,905 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:18:15,910 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:18:15,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:18:15,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:18:15,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-08 22:18:15,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-08 22:18:15,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-08 22:18:15,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-08 22:18:15,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-08 22:18:15,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-08 22:18:15,925 INFO L130 BoogieDeclarations]: Found specification of procedure ReadFromPort [2025-01-08 22:18:15,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ReadFromPort [2025-01-08 22:18:15,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:18:15,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:18:15,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-08 22:18:15,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-08 22:18:15,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-08 22:18:15,980 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:18:15,982 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:18:16,112 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-01-08 22:18:16,112 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:18:16,119 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:18:16,119 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-08 22:18:16,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:18:16 BoogieIcfgContainer [2025-01-08 22:18:16,119 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:18:16,121 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:18:16,121 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:18:16,124 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:18:16,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:18:15" (1/3) ... [2025-01-08 22:18:16,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f2f1b70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:18:16, skipping insertion in model container [2025-01-08 22:18:16,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:18:15" (2/3) ... [2025-01-08 22:18:16,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f2f1b70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:18:16, skipping insertion in model container [2025-01-08 22:18:16,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:18:16" (3/3) ... [2025-01-08 22:18:16,126 INFO L128 eAbstractionObserver]: Analyzing ICFG pnr5.c [2025-01-08 22:18:16,135 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:18:16,136 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pnr5.c that has 2 procedures, 35 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-08 22:18:16,175 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:18:16,185 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;@127fc824, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:18:16,185 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:18:16,189 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-08 22:18:16,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-08 22:18:16,194 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:18:16,194 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:18:16,194 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:18:16,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:18:16,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1051296688, now seen corresponding path program 1 times [2025-01-08 22:18:16,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:18:16,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200601246] [2025-01-08 22:18:16,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:18:16,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:18:16,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-08 22:18:16,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-08 22:18:16,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:18:16,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:18:16,570 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:18:16,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:18:16,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200601246] [2025-01-08 22:18:16,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200601246] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:18:16,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:18:16,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 22:18:16,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586034590] [2025-01-08 22:18:16,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:18:16,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:18:16,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:18:16,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:18:16,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:18:16,594 INFO L87 Difference]: Start difference. First operand has 35 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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-01-08 22:18:16,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:18:16,743 INFO L93 Difference]: Finished difference Result 89 states and 123 transitions. [2025-01-08 22:18:16,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:18:16,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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-01-08 22:18:16,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:18:16,749 INFO L225 Difference]: With dead ends: 89 [2025-01-08 22:18:16,749 INFO L226 Difference]: Without dead ends: 48 [2025-01-08 22:18:16,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:18:16,754 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 103 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:18:16,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 49 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:18:16,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-08 22:18:16,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2025-01-08 22:18:16,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-08 22:18:16,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2025-01-08 22:18:16,787 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 10 [2025-01-08 22:18:16,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:18:16,787 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2025-01-08 22:18:16,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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-01-08 22:18:16,788 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2025-01-08 22:18:16,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-08 22:18:16,789 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:18:16,789 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:18:16,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:18:16,789 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:18:16,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:18:16,790 INFO L85 PathProgramCache]: Analyzing trace with hash 124895690, now seen corresponding path program 1 times [2025-01-08 22:18:16,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:18:16,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258021895] [2025-01-08 22:18:16,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:18:16,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:18:16,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-08 22:18:16,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-08 22:18:16,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:18:16,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:18:17,461 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-08 22:18:17,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:18:17,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258021895] [2025-01-08 22:18:17,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258021895] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:18:17,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513532717] [2025-01-08 22:18:17,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:18:17,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:18:17,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:18:17,464 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:18:17,466 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:18:17,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-08 22:18:17,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-08 22:18:17,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:18:17,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:18:17,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-08 22:18:17,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:18:17,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-08 22:18:17,721 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 24 treesize of output 12 [2025-01-08 22:18:17,804 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 24 treesize of output 12 [2025-01-08 22:18:17,881 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 24 treesize of output 12 [2025-01-08 22:18:17,947 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 24 treesize of output 12 [2025-01-08 22:18:18,007 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-08 22:18:18,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:18:18,110 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 16 treesize of output 14 [2025-01-08 22:18:18,120 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 20 treesize of output 18 [2025-01-08 22:18:18,166 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-08 22:18:18,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513532717] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:18:18,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:18:18,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 20 [2025-01-08 22:18:18,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663613993] [2025-01-08 22:18:18,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:18:18,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-08 22:18:18,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:18:18,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-08 22:18:18,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2025-01-08 22:18:18,170 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 20 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2025-01-08 22:18:22,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:18:26,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:18:30,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:18:34,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:18:38,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:18:42,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:18:46,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:18:50,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:18:54,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:18:58,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:19:02,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:19:06,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:19:10,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:19:14,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:19:18,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:19:22,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:19:26,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:19:30,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:19:34,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:19:38,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:19:42,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:19:46,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:19:50,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:19:54,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:19:58,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:20:02,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:20:02,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:20:02,751 INFO L93 Difference]: Finished difference Result 116 states and 166 transitions. [2025-01-08 22:20:02,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-08 22:20:02,751 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) Word has length 42 [2025-01-08 22:20:02,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:20:02,752 INFO L225 Difference]: With dead ends: 116 [2025-01-08 22:20:02,752 INFO L226 Difference]: Without dead ends: 114 [2025-01-08 22:20:02,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 71 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2025-01-08 22:20:02,753 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 184 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 111 mSolverCounterUnsat, 26 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 104.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 26 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 104.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:20:02,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 257 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 307 Invalid, 26 Unknown, 0 Unchecked, 104.5s Time] [2025-01-08 22:20:02,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-08 22:20:02,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 55. [2025-01-08 22:20:02,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 42 states have internal predecessors, (54), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-08 22:20:02,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 76 transitions. [2025-01-08 22:20:02,775 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 76 transitions. Word has length 42 [2025-01-08 22:20:02,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:20:02,775 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 76 transitions. [2025-01-08 22:20:02,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2025-01-08 22:20:02,775 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 76 transitions. [2025-01-08 22:20:02,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-08 22:20:02,776 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:20:02,776 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:20:02,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 22:20:02,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:20:02,981 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:20:02,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:20:02,982 INFO L85 PathProgramCache]: Analyzing trace with hash 147527944, now seen corresponding path program 1 times [2025-01-08 22:20:02,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:20:02,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67004646] [2025-01-08 22:20:02,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:20:02,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:20:02,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-08 22:20:02,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-08 22:20:03,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:20:03,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:20:03,460 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-08 22:20:03,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:20:03,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67004646] [2025-01-08 22:20:03,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67004646] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:20:03,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744411117] [2025-01-08 22:20:03,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:20:03,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:20:03,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:20:03,462 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:20:03,464 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:20:03,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-08 22:20:03,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-08 22:20:03,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:20:03,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:20:03,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-08 22:20:03,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:20:03,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-08 22:20:03,636 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-01-08 22:20:03,681 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-01-08 22:20:03,728 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-01-08 22:20:03,773 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-01-08 22:20:03,821 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 15 treesize of output 7 [2025-01-08 22:20:03,840 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-08 22:20:03,840 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:20:03,916 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 15 treesize of output 13 [2025-01-08 22:20:03,917 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 18 treesize of output 16 [2025-01-08 22:20:03,958 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-08 22:20:03,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744411117] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:20:03,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:20:03,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 7] total 19 [2025-01-08 22:20:03,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888170791] [2025-01-08 22:20:03,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:20:03,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-08 22:20:03,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:20:03,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-08 22:20:03,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2025-01-08 22:20:03,960 INFO L87 Difference]: Start difference. First operand 55 states and 76 transitions. Second operand has 19 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 19 states have internal predecessors, (63), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15)