./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-crafted/xor5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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-crafted/xor5.i -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 a4ee2cdc1f0cbbd62309a70b71e98ce771ffa71f4ebd85e731799a93fbbc3919 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:15:12,895 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:15:12,974 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 10:15:12,980 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:15:12,983 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:15:13,008 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:15:13,009 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:15:13,009 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:15:13,010 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:15:13,010 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:15:13,010 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:15:13,010 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:15:13,011 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:15:13,011 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:15:13,011 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:15:13,011 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:15:13,011 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:15:13,011 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:15:13,011 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:15:13,011 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:15:13,012 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:15:13,012 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:15:13,012 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:15:13,012 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:15:13,012 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:15:13,012 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:15:13,012 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:15:13,012 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:15:13,013 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:15:13,013 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:15:13,013 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:15:13,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:15:13,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:15:13,013 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:15:13,013 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:15:13,013 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:15:13,013 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:15:13,013 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:15:13,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:15:13,013 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:15:13,013 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:15:13,014 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:15:13,014 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:15:13,014 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 -> a4ee2cdc1f0cbbd62309a70b71e98ce771ffa71f4ebd85e731799a93fbbc3919 [2025-02-05 10:15:13,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:15:13,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:15:13,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:15:13,321 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:15:13,322 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:15:13,323 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/xor5.i [2025-02-05 10:15:14,654 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e96f53e9d/104fc9d43f294f20ba720249d035de64/FLAG771744331 [2025-02-05 10:15:14,879 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:15:14,882 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-crafted/xor5.i [2025-02-05 10:15:14,907 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e96f53e9d/104fc9d43f294f20ba720249d035de64/FLAG771744331 [2025-02-05 10:15:15,224 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e96f53e9d/104fc9d43f294f20ba720249d035de64 [2025-02-05 10:15:15,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:15:15,228 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:15:15,229 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:15:15,230 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:15:15,233 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:15:15,233 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:15:15" (1/1) ... [2025-02-05 10:15:15,234 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1baad41c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:15, skipping insertion in model container [2025-02-05 10:15:15,234 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:15:15" (1/1) ... [2025-02-05 10:15:15,250 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:15:15,408 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-crafted/xor5.i[1364,1377] [2025-02-05 10:15:15,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:15:15,424 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:15:15,445 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-crafted/xor5.i[1364,1377] [2025-02-05 10:15:15,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:15:15,462 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:15:15,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:15 WrapperNode [2025-02-05 10:15:15,464 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:15:15,465 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:15:15,466 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:15:15,466 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:15:15,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:15" (1/1) ... [2025-02-05 10:15:15,483 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:15" (1/1) ... [2025-02-05 10:15:15,501 INFO L138 Inliner]: procedures = 16, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 75 [2025-02-05 10:15:15,503 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:15:15,504 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:15:15,504 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:15:15,504 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:15:15,512 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:15" (1/1) ... [2025-02-05 10:15:15,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:15" (1/1) ... [2025-02-05 10:15:15,514 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:15" (1/1) ... [2025-02-05 10:15:15,532 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 11, 7]. 55 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 0, 7]. The 5 writes are split as follows [0, 5, 0]. [2025-02-05 10:15:15,532 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:15" (1/1) ... [2025-02-05 10:15:15,533 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:15" (1/1) ... [2025-02-05 10:15:15,539 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:15" (1/1) ... [2025-02-05 10:15:15,539 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:15" (1/1) ... [2025-02-05 10:15:15,540 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:15" (1/1) ... [2025-02-05 10:15:15,541 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:15" (1/1) ... [2025-02-05 10:15:15,542 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:15:15,543 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:15:15,543 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:15:15,543 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:15:15,544 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:15" (1/1) ... [2025-02-05 10:15:15,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:15:15,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:15:15,575 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-02-05 10:15:15,580 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-02-05 10:15:15,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:15:15,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:15:15,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 10:15:15,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 10:15:15,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 10:15:15,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 10:15:15,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 10:15:15,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 10:15:15,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:15:15,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:15:15,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 10:15:15,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 10:15:15,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 10:15:15,603 INFO L130 BoogieDeclarations]: Found specification of procedure xor [2025-02-05 10:15:15,603 INFO L138 BoogieDeclarations]: Found implementation of procedure xor [2025-02-05 10:15:15,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 10:15:15,678 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:15:15,682 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:15:15,839 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-02-05 10:15:15,840 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:15:15,857 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:15:15,857 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:15:15,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:15:15 BoogieIcfgContainer [2025-02-05 10:15:15,858 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:15:15,859 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:15:15,859 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:15:15,863 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:15:15,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:15:15" (1/3) ... [2025-02-05 10:15:15,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65048a85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:15:15, skipping insertion in model container [2025-02-05 10:15:15,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:15" (2/3) ... [2025-02-05 10:15:15,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65048a85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:15:15, skipping insertion in model container [2025-02-05 10:15:15,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:15:15" (3/3) ... [2025-02-05 10:15:15,866 INFO L128 eAbstractionObserver]: Analyzing ICFG xor5.i [2025-02-05 10:15:15,884 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:15:15,886 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG xor5.i that has 2 procedures, 28 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-02-05 10:15:15,939 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:15:15,951 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;@64de1bf3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:15:15,952 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:15:15,957 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 10:15:15,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 10:15:15,963 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:15:15,963 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:15:15,964 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:15:15,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:15:15,971 INFO L85 PathProgramCache]: Analyzing trace with hash 169991808, now seen corresponding path program 1 times [2025-02-05 10:15:15,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:15:15,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865244013] [2025-02-05 10:15:15,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:15:15,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:15:16,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 10:15:16,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 10:15:16,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:15:16,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:15:16,279 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 10:15:16,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:15:16,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865244013] [2025-02-05 10:15:16,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865244013] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:15:16,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:15:16,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:15:16,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760562769] [2025-02-05 10:15:16,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:15:16,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:15:16,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:15:16,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:15:16,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:15:16,310 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:15:16,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:15:16,364 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2025-02-05 10:15:16,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:15:16,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2025-02-05 10:15:16,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:15:16,371 INFO L225 Difference]: With dead ends: 53 [2025-02-05 10:15:16,371 INFO L226 Difference]: Without dead ends: 24 [2025-02-05 10:15:16,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:15:16,376 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:15:16,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:15:16,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-05 10:15:16,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-02-05 10:15:16,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 10:15:16,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2025-02-05 10:15:16,413 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 25 [2025-02-05 10:15:16,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:15:16,413 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2025-02-05 10:15:16,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:15:16,414 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2025-02-05 10:15:16,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 10:15:16,417 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:15:16,417 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:15:16,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:15:16,418 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:15:16,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:15:16,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1576506963, now seen corresponding path program 1 times [2025-02-05 10:15:16,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:15:16,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930236114] [2025-02-05 10:15:16,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:15:16,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:15:16,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 10:15:16,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 10:15:16,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:15:16,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:15:16,592 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 10:15:16,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:15:16,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930236114] [2025-02-05 10:15:16,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930236114] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:15:16,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120209884] [2025-02-05 10:15:16,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:15:16,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:15:16,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:15:16,599 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-02-05 10:15:16,600 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-02-05 10:15:16,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 10:15:16,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 10:15:16,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:15:16,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:15:16,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 10:15:16,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:15:16,790 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 10:15:16,791 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:15:16,863 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 10:15:16,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120209884] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:15:16,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:15:16,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2025-02-05 10:15:16,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557291371] [2025-02-05 10:15:16,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:15:16,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 10:15:16,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:15:16,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 10:15:16,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 10:15:16,871 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 10:15:16,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:15:16,980 INFO L93 Difference]: Finished difference Result 50 states and 71 transitions. [2025-02-05 10:15:16,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 10:15:16,981 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 26 [2025-02-05 10:15:16,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:15:16,981 INFO L225 Difference]: With dead ends: 50 [2025-02-05 10:15:16,982 INFO L226 Difference]: Without dead ends: 31 [2025-02-05 10:15:16,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-05 10:15:16,984 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 42 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:15:16,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 82 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:15:16,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-02-05 10:15:16,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2025-02-05 10:15:16,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 10:15:16,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2025-02-05 10:15:16,996 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 26 [2025-02-05 10:15:16,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:15:16,996 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2025-02-05 10:15:16,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 10:15:16,997 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2025-02-05 10:15:16,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-05 10:15:16,997 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:15:16,997 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:15:17,007 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-02-05 10:15:17,203 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-02-05 10:15:17,203 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:15:17,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:15:17,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1147890558, now seen corresponding path program 1 times [2025-02-05 10:15:17,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:15:17,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501459893] [2025-02-05 10:15:17,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:15:17,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:15:17,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-05 10:15:17,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-05 10:15:17,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:15:17,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:15:17,319 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-05 10:15:17,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:15:17,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501459893] [2025-02-05 10:15:17,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501459893] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:15:17,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:15:17,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:15:17,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506977769] [2025-02-05 10:15:17,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:15:17,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:15:17,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:15:17,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:15:17,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:15:17,321 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 10:15:17,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:15:17,373 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2025-02-05 10:15:17,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:15:17,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2025-02-05 10:15:17,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:15:17,374 INFO L225 Difference]: With dead ends: 42 [2025-02-05 10:15:17,374 INFO L226 Difference]: Without dead ends: 27 [2025-02-05 10:15:17,375 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-02-05 10:15:17,375 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 22 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:15:17,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 36 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:15:17,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-05 10:15:17,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-02-05 10:15:17,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 10:15:17,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2025-02-05 10:15:17,387 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 36 [2025-02-05 10:15:17,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:15:17,388 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2025-02-05 10:15:17,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 10:15:17,388 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2025-02-05 10:15:17,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 10:15:17,389 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:15:17,389 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:15:17,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 10:15:17,389 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:15:17,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:15:17,391 INFO L85 PathProgramCache]: Analyzing trace with hash 636144981, now seen corresponding path program 1 times [2025-02-05 10:15:17,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:15:17,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857638655] [2025-02-05 10:15:17,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:15:17,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:15:17,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 10:15:17,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 10:15:17,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:15:17,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:15:20,181 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 10:15:20,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:15:20,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857638655] [2025-02-05 10:15:20,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857638655] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:15:20,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707007767] [2025-02-05 10:15:20,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:15:20,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:15:20,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:15:20,186 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-02-05 10:15:20,188 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-02-05 10:15:20,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 10:15:20,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 10:15:20,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:15:20,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:15:20,315 WARN L254 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 104 conjuncts are in the unsatisfiable core [2025-02-05 10:15:20,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:15:20,423 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-02-05 10:15:20,908 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 64 treesize of output 33 [2025-02-05 10:15:21,721 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:15:21,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 43 [2025-02-05 10:15:21,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:15:21,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 43 [2025-02-05 10:15:22,602 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 10:15:22,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:15:25,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707007767] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:15:25,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 10:15:25,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 31] total 56 [2025-02-05 10:15:25,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113409301] [2025-02-05 10:15:25,009 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 10:15:25,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-02-05 10:15:25,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:15:25,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-02-05 10:15:25,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=4935, Unknown=0, NotChecked=0, Total=5256 [2025-02-05 10:15:25,014 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 56 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 48 states have internal predecessors, (58), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-05 10:15:27,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:15:27,809 INFO L93 Difference]: Finished difference Result 138 states and 199 transitions. [2025-02-05 10:15:27,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-02-05 10:15:27,810 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 48 states have internal predecessors, (58), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 37 [2025-02-05 10:15:27,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:15:27,813 INFO L225 Difference]: With dead ends: 138 [2025-02-05 10:15:27,813 INFO L226 Difference]: Without dead ends: 134 [2025-02-05 10:15:27,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2797 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=730, Invalid=9572, Unknown=0, NotChecked=0, Total=10302 [2025-02-05 10:15:27,820 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 182 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 2332 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 2372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:15:27,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 377 Invalid, 2372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2332 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 10:15:27,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-02-05 10:15:27,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 75. [2025-02-05 10:15:27,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 64 states have internal predecessors, (86), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2025-02-05 10:15:27,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 106 transitions. [2025-02-05 10:15:27,864 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 106 transitions. Word has length 37 [2025-02-05 10:15:27,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:15:27,864 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 106 transitions. [2025-02-05 10:15:27,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 48 states have internal predecessors, (58), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-05 10:15:27,865 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 106 transitions. [2025-02-05 10:15:27,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-05 10:15:27,867 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:15:27,867 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:15:27,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 10:15:28,071 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-02-05 10:15:28,071 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:15:28,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:15:28,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1234238558, now seen corresponding path program 1 times [2025-02-05 10:15:28,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:15:28,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544396141] [2025-02-05 10:15:28,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:15:28,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:15:28,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-05 10:15:28,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 10:15:28,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:15:28,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:15:28,514 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:15:28,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:15:28,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544396141] [2025-02-05 10:15:28,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544396141] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:15:28,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940903241] [2025-02-05 10:15:28,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:15:28,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:15:28,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:15:28,517 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-02-05 10:15:28,520 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-02-05 10:15:28,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-05 10:15:28,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 10:15:28,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:15:28,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:15:28,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-05 10:15:28,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:15:28,607 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 8 treesize of output 1 [2025-02-05 10:15:28,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:15:28,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 19 [2025-02-05 10:15:28,769 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 19 [2025-02-05 10:15:28,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:15:28,806 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2025-02-05 10:15:28,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 43 treesize of output 26 [2025-02-05 10:15:28,900 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 10:15:28,902 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:15:41,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940903241] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:15:41,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 10:15:41,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 21 [2025-02-05 10:15:41,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978314378] [2025-02-05 10:15:41,095 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 10:15:41,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 10:15:41,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:15:41,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 10:15:41,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=542, Unknown=3, NotChecked=0, Total=650 [2025-02-05 10:15:41,096 INFO L87 Difference]: Start difference. First operand 75 states and 106 transitions. Second operand has 21 states, 20 states have (on average 2.55) internal successors, (51), 18 states have internal predecessors, (51), 3 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-05 10:15:45,107 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-02-05 10:15:49,112 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-02-05 10:15:53,119 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-02-05 10:15:57,262 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-02-05 10:16:01,270 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-02-05 10:16:05,279 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-02-05 10:16:09,491 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-02-05 10:16:13,503 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-02-05 10:16:17,536 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-02-05 10:16:21,543 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-02-05 10:16:25,549 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-02-05 10:16:29,556 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-02-05 10:16:33,571 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-02-05 10:16:37,583 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-02-05 10:16:41,608 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-02-05 10:16:41,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:16:41,700 INFO L93 Difference]: Finished difference Result 239 states and 346 transitions. [2025-02-05 10:16:41,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 10:16:41,700 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.55) internal successors, (51), 18 states have internal predecessors, (51), 3 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 38 [2025-02-05 10:16:41,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:16:41,702 INFO L225 Difference]: With dead ends: 239 [2025-02-05 10:16:41,703 INFO L226 Difference]: Without dead ends: 213 [2025-02-05 10:16:41,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=215, Invalid=1114, Unknown=3, NotChecked=0, Total=1332 [2025-02-05 10:16:41,704 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 111 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 21 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 60.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 60.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:16:41,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 282 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 581 Invalid, 15 Unknown, 0 Unchecked, 60.4s Time] [2025-02-05 10:16:41,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-02-05 10:16:41,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 136. [2025-02-05 10:16:41,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 114 states have (on average 1.4385964912280702) internal successors, (164), 118 states have internal predecessors, (164), 11 states have call successors, (11), 6 states have call predecessors, (11), 10 states have return successors, (21), 11 states have call predecessors, (21), 11 states have call successors, (21) [2025-02-05 10:16:41,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 196 transitions. [2025-02-05 10:16:41,726 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 196 transitions. Word has length 38 [2025-02-05 10:16:41,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:16:41,727 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 196 transitions. [2025-02-05 10:16:41,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.55) internal successors, (51), 18 states have internal predecessors, (51), 3 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-05 10:16:41,727 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 196 transitions. [2025-02-05 10:16:41,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-05 10:16:41,728 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:16:41,729 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:16:41,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 10:16:41,933 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-02-05 10:16:41,933 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:16:41,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:16:41,933 INFO L85 PathProgramCache]: Analyzing trace with hash -915189746, now seen corresponding path program 2 times [2025-02-05 10:16:41,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:16:41,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377870183] [2025-02-05 10:16:41,934 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:16:41,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:16:41,941 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-02-05 10:16:42,005 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 10:16:42,005 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:16:42,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:16:45,539 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 10:16:45,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:16:45,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377870183] [2025-02-05 10:16:45,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377870183] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:16:45,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823849288] [2025-02-05 10:16:45,539 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:16:45,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:16:45,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:16:45,541 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-02-05 10:16:45,542 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-02-05 10:16:45,584 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-02-05 10:16:45,613 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 10:16:45,613 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:16:45,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:16:45,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 87 conjuncts are in the unsatisfiable core [2025-02-05 10:16:45,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:16:45,700 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-02-05 10:16:46,091 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 64 treesize of output 33 [2025-02-05 10:16:46,521 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 90 treesize of output 54 [2025-02-05 10:16:46,681 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-02-05 10:16:47,011 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 124 treesize of output 76 [2025-02-05 10:16:47,164 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 10:16:47,165 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:16:47,653 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 63 treesize of output 57 [2025-02-05 10:16:47,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 69 [2025-02-05 10:16:47,673 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 59 treesize of output 53 [2025-02-05 10:16:47,676 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 73 treesize of output 61