./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-52.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-52.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 68087ce39f875d0c4fcddd2229459f24d441251a368024f44145e4f051f2f74c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:56:49,228 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:56:49,281 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 22:56:49,284 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:56:49,284 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:56:49,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:56:49,303 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:56:49,303 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:56:49,304 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:56:49,304 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:56:49,304 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:56:49,304 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:56:49,304 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:56:49,304 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:56:49,304 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:56:49,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:56:49,304 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:56:49,304 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 22:56:49,304 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 22:56:49,304 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 22:56:49,305 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:56:49,305 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:56:49,305 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:56:49,305 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:56:49,305 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 22:56:49,305 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:56:49,305 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:56:49,305 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:56:49,305 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:56:49,305 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:56:49,305 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:56:49,305 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:56:49,305 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:56:49,305 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:56:49,306 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:56:49,306 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:56:49,306 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:56:49,306 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 22:56:49,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 22:56:49,306 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:56:49,306 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:56:49,306 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:56:49,307 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:56:49,307 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 68087ce39f875d0c4fcddd2229459f24d441251a368024f44145e4f051f2f74c [2025-03-16 22:56:49,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:56:49,543 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:56:49,546 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:56:49,547 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:56:49,548 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:56:49,549 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-52.i [2025-03-16 22:56:50,732 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57915fdbc/0b6b56e45cfd4f81a6046336b01e8607/FLAGf0cefe9ae [2025-03-16 22:56:50,936 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:56:50,937 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-52.i [2025-03-16 22:56:50,942 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57915fdbc/0b6b56e45cfd4f81a6046336b01e8607/FLAGf0cefe9ae [2025-03-16 22:56:51,295 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57915fdbc/0b6b56e45cfd4f81a6046336b01e8607 [2025-03-16 22:56:51,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:56:51,298 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:56:51,299 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:56:51,299 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:56:51,302 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:56:51,303 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:56:51" (1/1) ... [2025-03-16 22:56:51,303 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5899e3e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:51, skipping insertion in model container [2025-03-16 22:56:51,303 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:56:51" (1/1) ... [2025-03-16 22:56:51,316 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:56:51,419 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-52.i[919,932] [2025-03-16 22:56:51,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:56:51,476 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:56:51,485 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-52.i[919,932] [2025-03-16 22:56:51,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:56:51,528 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:56:51,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:51 WrapperNode [2025-03-16 22:56:51,528 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:56:51,529 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:56:51,529 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:56:51,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:56:51,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:51" (1/1) ... [2025-03-16 22:56:51,537 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:51" (1/1) ... [2025-03-16 22:56:51,559 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2025-03-16 22:56:51,559 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:56:51,560 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:56:51,560 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:56:51,560 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:56:51,567 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:51" (1/1) ... [2025-03-16 22:56:51,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:51" (1/1) ... [2025-03-16 22:56:51,569 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:51" (1/1) ... [2025-03-16 22:56:51,578 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-03-16 22:56:51,578 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:51" (1/1) ... [2025-03-16 22:56:51,578 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:51" (1/1) ... [2025-03-16 22:56:51,584 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:51" (1/1) ... [2025-03-16 22:56:51,585 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:51" (1/1) ... [2025-03-16 22:56:51,586 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:51" (1/1) ... [2025-03-16 22:56:51,590 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:51" (1/1) ... [2025-03-16 22:56:51,592 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:56:51,593 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:56:51,594 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:56:51,594 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:56:51,595 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:51" (1/1) ... [2025-03-16 22:56:51,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:56:51,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:56:51,617 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 22:56:51,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 22:56:51,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:56:51,637 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 22:56:51,637 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 22:56:51,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 22:56:51,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:56:51,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:56:51,688 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:56:51,689 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:56:51,869 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-16 22:56:51,869 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:56:51,875 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:56:51,876 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:56:51,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:56:51 BoogieIcfgContainer [2025-03-16 22:56:51,876 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:56:51,879 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:56:51,879 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:56:51,882 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:56:51,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:56:51" (1/3) ... [2025-03-16 22:56:51,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45257d31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:56:51, skipping insertion in model container [2025-03-16 22:56:51,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:56:51" (2/3) ... [2025-03-16 22:56:51,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45257d31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:56:51, skipping insertion in model container [2025-03-16 22:56:51,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:56:51" (3/3) ... [2025-03-16 22:56:51,885 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-52.i [2025-03-16 22:56:51,894 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:56:51,896 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-52.i that has 2 procedures, 42 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:56:51,933 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:56:51,943 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;@45f136dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:56:51,943 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:56:51,946 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 28 states have internal predecessors, (41), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-16 22:56:51,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 22:56:51,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:56:51,953 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 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-03-16 22:56:51,953 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:56:51,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:56:51,957 INFO L85 PathProgramCache]: Analyzing trace with hash -255878740, now seen corresponding path program 1 times [2025-03-16 22:56:51,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:56:51,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255296103] [2025-03-16 22:56:51,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:56:51,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:56:52,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 22:56:52,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 22:56:52,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:56:52,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:56:52,143 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-16 22:56:52,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:56:52,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255296103] [2025-03-16 22:56:52,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255296103] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:56:52,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611707241] [2025-03-16 22:56:52,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:56:52,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:56:52,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:56:52,149 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 22:56:52,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 22:56:52,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 22:56:52,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 22:56:52,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:56:52,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:56:52,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 22:56:52,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:56:52,260 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-16 22:56:52,261 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:56:52,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611707241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:56:52,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 22:56:52,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 22:56:52,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102399084] [2025-03-16 22:56:52,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:56:52,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 22:56:52,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:56:52,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 22:56:52,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 22:56:52,281 INFO L87 Difference]: Start difference. First operand has 42 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 28 states have internal predecessors, (41), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-16 22:56:52,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:56:52,315 INFO L93 Difference]: Finished difference Result 81 states and 140 transitions. [2025-03-16 22:56:52,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 22:56:52,316 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 78 [2025-03-16 22:56:52,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:56:52,320 INFO L225 Difference]: With dead ends: 81 [2025-03-16 22:56:52,320 INFO L226 Difference]: Without dead ends: 40 [2025-03-16 22:56:52,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 22:56:52,328 INFO L435 NwaCegarLoop]: 61 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, 61 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 22:56:52,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 22:56:52,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-16 22:56:52,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-16 22:56:52,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-16 22:56:52,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 61 transitions. [2025-03-16 22:56:52,358 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 61 transitions. Word has length 78 [2025-03-16 22:56:52,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:56:52,358 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 61 transitions. [2025-03-16 22:56:52,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-16 22:56:52,359 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 61 transitions. [2025-03-16 22:56:52,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 22:56:52,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:56:52,361 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 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-03-16 22:56:52,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 22:56:52,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-16 22:56:52,566 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:56:52,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:56:52,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1435895212, now seen corresponding path program 1 times [2025-03-16 22:56:52,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:56:52,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777284262] [2025-03-16 22:56:52,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:56:52,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:56:52,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 22:56:52,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 22:56:52,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:56:52,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:56:57,525 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-16 22:56:57,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:56:57,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777284262] [2025-03-16 22:56:57,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777284262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:56:57,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:56:57,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 22:56:57,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762629229] [2025-03-16 22:56:57,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:56:57,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 22:56:57,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:56:57,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 22:56:57,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:56:57,527 INFO L87 Difference]: Start difference. First operand 40 states and 61 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-16 22:56:58,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:56:58,053 INFO L93 Difference]: Finished difference Result 61 states and 90 transitions. [2025-03-16 22:56:58,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 22:56:58,053 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 78 [2025-03-16 22:56:58,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:56:58,054 INFO L225 Difference]: With dead ends: 61 [2025-03-16 22:56:58,054 INFO L226 Difference]: Without dead ends: 59 [2025-03-16 22:56:58,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2025-03-16 22:56:58,055 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 86 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:56:58,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 159 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:56:58,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-16 22:56:58,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2025-03-16 22:56:58,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 33 states have internal predecessors, (49), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-16 22:56:58,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 73 transitions. [2025-03-16 22:56:58,061 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 73 transitions. Word has length 78 [2025-03-16 22:56:58,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:56:58,063 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 73 transitions. [2025-03-16 22:56:58,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-16 22:56:58,064 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 73 transitions. [2025-03-16 22:56:58,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 22:56:58,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:56:58,067 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 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-03-16 22:56:58,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 22:56:58,067 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:56:58,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:56:58,068 INFO L85 PathProgramCache]: Analyzing trace with hash 658745613, now seen corresponding path program 1 times [2025-03-16 22:56:58,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:56:58,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237150091] [2025-03-16 22:56:58,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:56:58,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:56:58,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 22:56:58,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 22:56:58,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:56:58,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:57:01,005 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-16 22:57:01,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:57:01,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237150091] [2025-03-16 22:57:01,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237150091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:57:01,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:57:01,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 22:57:01,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045072983] [2025-03-16 22:57:01,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:57:01,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 22:57:01,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:57:01,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 22:57:01,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:57:01,007 INFO L87 Difference]: Start difference. First operand 47 states and 73 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-16 22:57:01,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:57:01,262 INFO L93 Difference]: Finished difference Result 114 states and 172 transitions. [2025-03-16 22:57:01,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:57:01,262 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 78 [2025-03-16 22:57:01,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:57:01,263 INFO L225 Difference]: With dead ends: 114 [2025-03-16 22:57:01,263 INFO L226 Difference]: Without dead ends: 68 [2025-03-16 22:57:01,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:57:01,264 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 81 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:57:01,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 163 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:57:01,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-16 22:57:01,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2025-03-16 22:57:01,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-16 22:57:01,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 93 transitions. [2025-03-16 22:57:01,277 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 93 transitions. Word has length 78 [2025-03-16 22:57:01,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:57:01,278 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 93 transitions. [2025-03-16 22:57:01,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-16 22:57:01,278 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 93 transitions. [2025-03-16 22:57:01,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 22:57:01,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:57:01,279 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 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-03-16 22:57:01,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 22:57:01,279 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:57:01,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:57:01,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1565910713, now seen corresponding path program 1 times [2025-03-16 22:57:01,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:57:01,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612067332] [2025-03-16 22:57:01,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:57:01,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:57:01,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 22:57:01,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 22:57:01,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:57:01,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:57:04,270 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-16 22:57:04,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:57:04,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612067332] [2025-03-16 22:57:04,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612067332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:57:04,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:57:04,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 22:57:04,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022278601] [2025-03-16 22:57:04,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:57:04,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 22:57:04,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:57:04,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 22:57:04,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-16 22:57:04,272 INFO L87 Difference]: Start difference. First operand 64 states and 93 transitions. Second operand has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 13 states have internal predecessors, (22), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-16 22:57:04,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:57:04,949 INFO L93 Difference]: Finished difference Result 217 states and 313 transitions. [2025-03-16 22:57:04,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 22:57:04,949 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 13 states have internal predecessors, (22), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 79 [2025-03-16 22:57:04,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:57:04,951 INFO L225 Difference]: With dead ends: 217 [2025-03-16 22:57:04,951 INFO L226 Difference]: Without dead ends: 154 [2025-03-16 22:57:04,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2025-03-16 22:57:04,953 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 187 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:57:04,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 206 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:57:04,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-16 22:57:04,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 105. [2025-03-16 22:57:04,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 71 states have internal predecessors, (90), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-16 22:57:04,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 150 transitions. [2025-03-16 22:57:04,965 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 150 transitions. Word has length 79 [2025-03-16 22:57:04,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:57:04,966 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 150 transitions. [2025-03-16 22:57:04,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 13 states have internal predecessors, (22), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-16 22:57:04,966 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 150 transitions. [2025-03-16 22:57:04,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 22:57:04,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:57:04,967 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 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-03-16 22:57:04,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 22:57:04,967 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:57:04,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:57:04,968 INFO L85 PathProgramCache]: Analyzing trace with hash -231040646, now seen corresponding path program 1 times [2025-03-16 22:57:04,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:57:04,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839816164] [2025-03-16 22:57:04,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:57:04,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:57:04,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 22:57:04,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 22:57:04,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:57:04,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:57:05,013 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-16 22:57:05,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:57:05,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839816164] [2025-03-16 22:57:05,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839816164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:57:05,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:57:05,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:57:05,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585535662] [2025-03-16 22:57:05,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:57:05,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:57:05,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:57:05,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:57:05,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:57:05,015 INFO L87 Difference]: Start difference. First operand 105 states and 150 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-16 22:57:05,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:57:05,074 INFO L93 Difference]: Finished difference Result 168 states and 242 transitions. [2025-03-16 22:57:05,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 22:57:05,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 79 [2025-03-16 22:57:05,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:57:05,077 INFO L225 Difference]: With dead ends: 168 [2025-03-16 22:57:05,077 INFO L226 Difference]: Without dead ends: 105 [2025-03-16 22:57:05,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:57:05,080 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 60 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 22:57:05,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 51 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 22:57:05,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-16 22:57:05,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-16 22:57:05,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 71 states have internal predecessors, (88), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-16 22:57:05,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 148 transitions. [2025-03-16 22:57:05,101 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 148 transitions. Word has length 79 [2025-03-16 22:57:05,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:57:05,101 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 148 transitions. [2025-03-16 22:57:05,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-16 22:57:05,101 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 148 transitions. [2025-03-16 22:57:05,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-16 22:57:05,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:57:05,102 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:57:05,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 22:57:05,102 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:57:05,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:57:05,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1048846092, now seen corresponding path program 1 times [2025-03-16 22:57:05,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:57:05,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504957741] [2025-03-16 22:57:05,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:57:05,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:57:05,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-16 22:57:05,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-16 22:57:05,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:57:05,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:57:07,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1132 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1124 trivial. 0 not checked. [2025-03-16 22:57:07,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:57:07,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504957741] [2025-03-16 22:57:07,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504957741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:57:07,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:57:07,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 22:57:07,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393107448] [2025-03-16 22:57:07,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:57:07,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 22:57:07,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:57:07,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 22:57:07,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:57:07,802 INFO L87 Difference]: Start difference. First operand 105 states and 148 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-16 22:57:07,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:57:07,935 INFO L93 Difference]: Finished difference Result 165 states and 235 transitions. [2025-03-16 22:57:07,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 22:57:07,935 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 156 [2025-03-16 22:57:07,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:57:07,936 INFO L225 Difference]: With dead ends: 165 [2025-03-16 22:57:07,936 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 22:57:07,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-16 22:57:07,937 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 29 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:57:07,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 129 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:57:07,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 22:57:07,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 22:57:07,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:57:07,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 22:57:07,938 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 156 [2025-03-16 22:57:07,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:57:07,938 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 22:57:07,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-16 22:57:07,938 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 22:57:07,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 22:57:07,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 22:57:07,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 22:57:07,942 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-16 22:57:07,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 22:57:08,589 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 22:57:08,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 10:57:08 BoogieIcfgContainer [2025-03-16 22:57:08,606 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 22:57:08,606 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 22:57:08,606 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 22:57:08,607 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 22:57:08,607 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:56:51" (3/4) ... [2025-03-16 22:57:08,609 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 22:57:08,613 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-16 22:57:08,617 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-16 22:57:08,617 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 22:57:08,618 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 22:57:08,618 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 22:57:08,683 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 22:57:08,683 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 22:57:08,684 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 22:57:08,684 INFO L158 Benchmark]: Toolchain (without parser) took 17386.10ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 111.5MB in the beginning and 419.9MB in the end (delta: -308.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2025-03-16 22:57:08,685 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 226.5MB. Free memory is still 146.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:57:08,685 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.40ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 98.5MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 22:57:08,686 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.35ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 95.6MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:57:08,686 INFO L158 Benchmark]: Boogie Preprocessor took 32.95ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 92.7MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:57:08,687 INFO L158 Benchmark]: IcfgBuilder took 282.77ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 73.4MB in the end (delta: 19.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 22:57:08,687 INFO L158 Benchmark]: TraceAbstraction took 16726.80ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 72.8MB in the beginning and 428.0MB in the end (delta: -355.2MB). Peak memory consumption was 238.3MB. Max. memory is 16.1GB. [2025-03-16 22:57:08,687 INFO L158 Benchmark]: Witness Printer took 77.24ms. Allocated memory is still 478.2MB. Free memory was 424.2MB in the beginning and 419.9MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 22:57:08,688 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 226.5MB. Free memory is still 146.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 229.40ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 98.5MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.35ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 95.6MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.95ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 92.7MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 282.77ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 73.4MB in the end (delta: 19.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 16726.80ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 72.8MB in the beginning and 428.0MB in the end (delta: -355.2MB). Peak memory consumption was 238.3MB. Max. memory is 16.1GB. * Witness Printer took 77.24ms. Allocated memory is still 478.2MB. Free memory was 424.2MB in the beginning and 419.9MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 42 locations, 77 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.0s, OverallIterations: 6, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 443 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 443 mSDsluCounter, 769 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 485 mSDsCounter, 176 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 588 IncrementalHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 176 mSolverCounterUnsat, 284 mSDtfsCounter, 588 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=4, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 65 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 13.4s InterpolantComputationTime, 626 NumberOfCodeBlocks, 626 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 619 ConstructedInterpolants, 0 QuantifiedInterpolants, 4286 SizeOfPredicates, 0 NumberOfNonLiveVariables, 217 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 2694/2716 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 117]: Location Invariant Derived location invariant: ((((((((((var_1_1 == (256 + var_1_21)) && (var_1_20 == ((var_1_17 >= 0) ? (var_1_17 % 65536) : ((var_1_17 % 65536) + 65536)))) && (((var_1_17 >= 0) ? (var_1_17 / 65536) : ((var_1_17 / 65536) - 1)) <= 0)) && (((var_1_9 == var_1_7) || (((((4294967295 * var_1_10) + var_1_8) % 4294967296) <= last_1_var_1_7) && ((var_1_8 + 1) <= var_1_9))) || (((var_1_12 == 0) || ((((4294967295 * var_1_10) + var_1_9) % 4294967296) < ((long long) last_1_var_1_7 + 1))) && ((var_1_12 == 0) || (var_1_9 < (var_1_8 + 1)))))) && (var_1_8 == var_1_21)) && ((256 + var_1_22) == 0)) && ((999999950 + var_1_8) == (((long long) ((int) var_1_9 + last_1_var_1_20) + var_1_17) + var_1_10))) && (128 <= last_1_var_1_17)) && ((((var_1_12 == 1) && (var_1_14 != 0)) && (var_1_13 != 0)) || ((var_1_12 == 0) && ((var_1_14 == 0) || (var_1_13 == 0))))) || (((((((((128 <= var_1_20) && (var_1_12 == 0)) && (((long long) var_1_7 + var_1_20) <= 192)) && (0 <= 0)) && (128 <= last_1_var_1_17)) && (0 <= 0)) && ((var_1_14 == 0) || (var_1_13 == 0))) && (((long long) var_1_7 + last_1_var_1_20) <= 192)) && (128 <= var_1_17))) RESULT: Ultimate proved your program to be correct! [2025-03-16 22:57:08,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE