./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-28.i --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/hardness-nfm22/hardness_codestructure_dependencies_file-28.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 44de77de34b304b66adb966724182e50eb80f224705e17f8fba1754b6f5e2a38 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:25:51,809 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:25:51,870 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 08:25:51,873 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:25:51,873 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:25:51,885 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:25:51,886 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:25:51,886 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:25:51,886 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:25:51,886 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:25:51,886 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:25:51,887 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:25:51,887 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:25:51,887 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:25:51,887 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:25:51,887 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:25:51,887 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:25:51,887 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 08:25:51,887 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 08:25:51,887 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 08:25:51,888 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:25:51,888 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:25:51,888 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:25:51,888 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:25:51,888 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 08:25:51,888 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:25:51,888 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:25:51,888 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:25:51,888 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:25:51,888 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:25:51,888 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:25:51,888 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:25:51,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:25:51,889 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:25:51,889 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:25:51,889 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:25:51,889 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:25:51,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:25:51,889 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:25:51,889 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:25:51,889 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:25:51,889 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:25:51,889 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 08:25:51,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 08:25:51,889 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:25:51,890 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:25:51,890 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:25:51,890 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:25:51,890 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 -> 44de77de34b304b66adb966724182e50eb80f224705e17f8fba1754b6f5e2a38 [2025-01-09 08:25:52,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:25:52,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:25:52,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:25:52,068 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:25:52,069 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:25:52,069 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-28.i [2025-01-09 08:25:53,217 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7372b1814/c478a162c08140a3b9c85856753fa1ca/FLAGf678b6f1b [2025-01-09 08:25:53,486 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:25:53,487 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-28.i [2025-01-09 08:25:53,493 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7372b1814/c478a162c08140a3b9c85856753fa1ca/FLAGf678b6f1b [2025-01-09 08:25:53,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7372b1814/c478a162c08140a3b9c85856753fa1ca [2025-01-09 08:25:53,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:25:53,799 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:25:53,800 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:25:53,800 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:25:53,802 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:25:53,803 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:25:53" (1/1) ... [2025-01-09 08:25:53,803 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a72b5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:25:53, skipping insertion in model container [2025-01-09 08:25:53,803 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:25:53" (1/1) ... [2025-01-09 08:25:53,814 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:25:53,889 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/hardness-nfm22/hardness_codestructure_dependencies_file-28.i[919,932] [2025-01-09 08:25:53,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:25:53,933 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:25:53,940 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/hardness-nfm22/hardness_codestructure_dependencies_file-28.i[919,932] [2025-01-09 08:25:53,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:25:53,975 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:25:53,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:25:53 WrapperNode [2025-01-09 08:25:53,976 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:25:53,977 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:25:53,977 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:25:53,977 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:25:53,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:25:53" (1/1) ... [2025-01-09 08:25:53,987 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:25:53" (1/1) ... [2025-01-09 08:25:54,013 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 163 [2025-01-09 08:25:54,014 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:25:54,014 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:25:54,014 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:25:54,014 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:25:54,020 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:25:53" (1/1) ... [2025-01-09 08:25:54,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:25:53" (1/1) ... [2025-01-09 08:25:54,029 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:25:53" (1/1) ... [2025-01-09 08:25:54,058 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 08:25:54,058 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:25:53" (1/1) ... [2025-01-09 08:25:54,059 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:25:53" (1/1) ... [2025-01-09 08:25:54,072 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:25:53" (1/1) ... [2025-01-09 08:25:54,074 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:25:53" (1/1) ... [2025-01-09 08:25:54,076 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:25:53" (1/1) ... [2025-01-09 08:25:54,077 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:25:53" (1/1) ... [2025-01-09 08:25:54,078 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:25:53" (1/1) ... [2025-01-09 08:25:54,081 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:25:54,081 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:25:54,082 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:25:54,082 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:25:54,082 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:25:53" (1/1) ... [2025-01-09 08:25:54,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:25:54,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:25:54,103 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-09 08:25:54,108 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-09 08:25:54,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:25:54,119 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 08:25:54,119 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 08:25:54,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 08:25:54,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:25:54,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:25:54,169 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:25:54,171 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:25:54,446 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 08:25:54,446 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:25:54,452 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:25:54,452 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:25:54,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:25:54 BoogieIcfgContainer [2025-01-09 08:25:54,453 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:25:54,454 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:25:54,454 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:25:54,457 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:25:54,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:25:53" (1/3) ... [2025-01-09 08:25:54,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ce33be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:25:54, skipping insertion in model container [2025-01-09 08:25:54,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:25:53" (2/3) ... [2025-01-09 08:25:54,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ce33be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:25:54, skipping insertion in model container [2025-01-09 08:25:54,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:25:54" (3/3) ... [2025-01-09 08:25:54,459 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-28.i [2025-01-09 08:25:54,469 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:25:54,470 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-28.i that has 2 procedures, 71 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:25:54,516 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:25:54,526 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;@5e003681, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:25:54,527 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:25:54,530 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 46 states have (on average 1.391304347826087) internal successors, (64), 47 states have internal predecessors, (64), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 08:25:54,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 08:25:54,540 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:25:54,540 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:25:54,541 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:25:54,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:25:54,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1369985610, now seen corresponding path program 1 times [2025-01-09 08:25:54,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:25:54,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916121710] [2025-01-09 08:25:54,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:25:54,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:25:54,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 08:25:54,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 08:25:54,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:25:54,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:25:54,760 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-01-09 08:25:54,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:25:54,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916121710] [2025-01-09 08:25:54,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916121710] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:25:54,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320613181] [2025-01-09 08:25:54,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:25:54,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:25:54,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:25:54,764 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-09 08:25:54,766 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-09 08:25:54,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 08:25:54,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 08:25:54,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:25:54,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:25:54,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 08:25:54,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:25:54,907 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-01-09 08:25:54,909 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:25:54,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320613181] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:25:54,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 08:25:54,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 08:25:54,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127834012] [2025-01-09 08:25:54,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:25:54,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 08:25:54,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:25:54,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 08:25:54,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 08:25:54,930 INFO L87 Difference]: Start difference. First operand has 71 states, 46 states have (on average 1.391304347826087) internal successors, (64), 47 states have internal predecessors, (64), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 08:25:54,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:25:54,948 INFO L93 Difference]: Finished difference Result 136 states and 233 transitions. [2025-01-09 08:25:54,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 08:25:54,949 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 141 [2025-01-09 08:25:54,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:25:54,953 INFO L225 Difference]: With dead ends: 136 [2025-01-09 08:25:54,953 INFO L226 Difference]: Without dead ends: 68 [2025-01-09 08:25:54,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 08:25:54,957 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:25:54,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:25:54,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-01-09 08:25:54,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-01-09 08:25:54,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 08:25:54,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 103 transitions. [2025-01-09 08:25:54,982 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 103 transitions. Word has length 141 [2025-01-09 08:25:54,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:25:54,983 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 103 transitions. [2025-01-09 08:25:54,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 08:25:54,983 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 103 transitions. [2025-01-09 08:25:54,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 08:25:54,986 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:25:54,986 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:25:54,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 08:25:55,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 08:25:55,191 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:25:55,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:25:55,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1233357314, now seen corresponding path program 1 times [2025-01-09 08:25:55,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:25:55,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459635153] [2025-01-09 08:25:55,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:25:55,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:25:55,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 08:25:55,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 08:25:55,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:25:55,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:27:03,769 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 08:27:03,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:27:03,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459635153] [2025-01-09 08:27:03,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459635153] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:27:03,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:27:03,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 08:27:03,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187640783] [2025-01-09 08:27:03,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:27:03,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 08:27:03,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:27:03,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 08:27:03,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 08:27:03,776 INFO L87 Difference]: Start difference. First operand 68 states and 103 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 08:27:05,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:27:05,490 INFO L93 Difference]: Finished difference Result 290 states and 432 transitions. [2025-01-09 08:27:05,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 08:27:05,492 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 141 [2025-01-09 08:27:05,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:27:05,494 INFO L225 Difference]: With dead ends: 290 [2025-01-09 08:27:05,494 INFO L226 Difference]: Without dead ends: 225 [2025-01-09 08:27:05,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2025-01-09 08:27:05,495 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 600 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 08:27:05,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 456 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 08:27:05,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-01-09 08:27:05,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 139. [2025-01-09 08:27:05,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 92 states have (on average 1.3804347826086956) internal successors, (127), 92 states have internal predecessors, (127), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 08:27:05,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 215 transitions. [2025-01-09 08:27:05,527 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 215 transitions. Word has length 141 [2025-01-09 08:27:05,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:27:05,528 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 215 transitions. [2025-01-09 08:27:05,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 08:27:05,528 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 215 transitions. [2025-01-09 08:27:05,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 08:27:05,530 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:27:05,531 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:27:05,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 08:27:05,531 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:27:05,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:27:05,531 INFO L85 PathProgramCache]: Analyzing trace with hash -553298944, now seen corresponding path program 1 times [2025-01-09 08:27:05,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:27:05,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994217474] [2025-01-09 08:27:05,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:27:05,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:27:05,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 08:27:05,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 08:27:05,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:27:05,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:27:05,618 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 08:27:05,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:27:05,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994217474] [2025-01-09 08:27:05,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994217474] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:27:05,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:27:05,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:27:05,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213254482] [2025-01-09 08:27:05,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:27:05,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:27:05,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:27:05,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:27:05,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:27:05,621 INFO L87 Difference]: Start difference. First operand 139 states and 215 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 08:27:05,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:27:05,817 INFO L93 Difference]: Finished difference Result 379 states and 590 transitions. [2025-01-09 08:27:05,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:27:05,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 141 [2025-01-09 08:27:05,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:27:05,821 INFO L225 Difference]: With dead ends: 379 [2025-01-09 08:27:05,822 INFO L226 Difference]: Without dead ends: 243 [2025-01-09 08:27:05,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:27:05,824 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 258 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:27:05,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 387 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:27:05,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-01-09 08:27:05,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 145. [2025-01-09 08:27:05,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 98 states have (on average 1.3775510204081634) internal successors, (135), 98 states have internal predecessors, (135), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 08:27:05,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 223 transitions. [2025-01-09 08:27:05,854 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 223 transitions. Word has length 141 [2025-01-09 08:27:05,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:27:05,855 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 223 transitions. [2025-01-09 08:27:05,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 08:27:05,856 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 223 transitions. [2025-01-09 08:27:05,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 08:27:05,859 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:27:05,859 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:27:05,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 08:27:05,859 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:27:05,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:27:05,860 INFO L85 PathProgramCache]: Analyzing trace with hash -532292736, now seen corresponding path program 1 times [2025-01-09 08:27:05,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:27:05,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358468628] [2025-01-09 08:27:05,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:27:05,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:27:05,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 08:27:05,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 08:27:05,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:27:05,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat