./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-3.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_floatingpointinfluence_no-floats_file-3.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 a4661a79f995ce83b554327eb89182f2e104b0cd28a9d1560990b967de8c220f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:53:03,038 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:53:03,093 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 02:53:03,099 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:53:03,100 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:53:03,123 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:53:03,124 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:53:03,124 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:53:03,125 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:53:03,125 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:53:03,125 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:53:03,126 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:53:03,126 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:53:03,126 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:53:03,126 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:53:03,127 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:53:03,127 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:53:03,127 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:53:03,127 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 02:53:03,127 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:53:03,127 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:53:03,127 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:53:03,127 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:53:03,127 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:53:03,127 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:53:03,127 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:53:03,127 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:53:03,127 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:53:03,127 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:53:03,127 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:53:03,127 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:53:03,127 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:53:03,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:53:03,127 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:53:03,127 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:53:03,128 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:53:03,128 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:53:03,128 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 02:53:03,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 02:53:03,128 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:53:03,128 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:53:03,128 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:53:03,128 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:53:03,128 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 -> a4661a79f995ce83b554327eb89182f2e104b0cd28a9d1560990b967de8c220f [2025-03-17 02:53:03,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:53:03,407 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:53:03,410 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:53:03,412 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:53:03,412 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:53:03,414 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-3.i [2025-03-17 02:53:04,652 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4da10a973/7618e046afa445bca3aa5368a64b52a5/FLAG7112a29eb [2025-03-17 02:53:04,859 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:53:04,860 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-3.i [2025-03-17 02:53:04,868 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4da10a973/7618e046afa445bca3aa5368a64b52a5/FLAG7112a29eb [2025-03-17 02:53:04,884 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4da10a973/7618e046afa445bca3aa5368a64b52a5 [2025-03-17 02:53:04,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:53:04,888 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:53:04,889 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:53:04,890 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:53:04,893 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:53:04,894 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:53:04" (1/1) ... [2025-03-17 02:53:04,894 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42e0a1a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:04, skipping insertion in model container [2025-03-17 02:53:04,897 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:53:04" (1/1) ... [2025-03-17 02:53:04,910 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:53:05,029 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_floatingpointinfluence_no-floats_file-3.i[915,928] [2025-03-17 02:53:05,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:53:05,079 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:53:05,089 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_floatingpointinfluence_no-floats_file-3.i[915,928] [2025-03-17 02:53:05,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:53:05,131 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:53:05,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:05 WrapperNode [2025-03-17 02:53:05,132 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:53:05,134 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:53:05,134 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:53:05,134 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:53:05,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:05" (1/1) ... [2025-03-17 02:53:05,151 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:05" (1/1) ... [2025-03-17 02:53:05,175 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2025-03-17 02:53:05,176 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:53:05,176 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:53:05,177 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:53:05,177 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:53:05,183 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:05" (1/1) ... [2025-03-17 02:53:05,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:05" (1/1) ... [2025-03-17 02:53:05,185 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:05" (1/1) ... [2025-03-17 02:53:05,196 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-17 02:53:05,196 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:05" (1/1) ... [2025-03-17 02:53:05,196 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:05" (1/1) ... [2025-03-17 02:53:05,200 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:05" (1/1) ... [2025-03-17 02:53:05,202 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:05" (1/1) ... [2025-03-17 02:53:05,206 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:05" (1/1) ... [2025-03-17 02:53:05,206 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:05" (1/1) ... [2025-03-17 02:53:05,208 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:53:05,209 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:53:05,209 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:53:05,209 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:53:05,210 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:05" (1/1) ... [2025-03-17 02:53:05,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:53:05,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:53:05,232 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-17 02:53:05,234 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-17 02:53:05,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:53:05,249 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:53:05,249 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:53:05,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 02:53:05,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:53:05,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:53:05,301 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:53:05,303 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:53:05,519 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-17 02:53:05,519 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:53:05,530 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:53:05,532 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:53:05,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:53:05 BoogieIcfgContainer [2025-03-17 02:53:05,532 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:53:05,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:53:05,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:53:05,538 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:53:05,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:53:04" (1/3) ... [2025-03-17 02:53:05,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a300f76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:53:05, skipping insertion in model container [2025-03-17 02:53:05,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:05" (2/3) ... [2025-03-17 02:53:05,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a300f76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:53:05, skipping insertion in model container [2025-03-17 02:53:05,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:53:05" (3/3) ... [2025-03-17 02:53:05,541 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-3.i [2025-03-17 02:53:05,552 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:53:05,554 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-3.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:53:05,594 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:53:05,604 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;@6d953488, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:53:05,605 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:53:05,608 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 02:53:05,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 02:53:05,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:05,617 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:05,617 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:05,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:05,621 INFO L85 PathProgramCache]: Analyzing trace with hash 220041190, now seen corresponding path program 1 times [2025-03-17 02:53:05,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:05,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128935265] [2025-03-17 02:53:05,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:05,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:05,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 02:53:05,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 02:53:05,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:05,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:05,863 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-17 02:53:05,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:05,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128935265] [2025-03-17 02:53:05,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128935265] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:53:05,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188849635] [2025-03-17 02:53:05,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:05,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:53:05,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:53:05,868 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-17 02:53:05,870 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-17 02:53:05,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 02:53:06,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 02:53:06,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:06,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:06,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:53:06,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:53:06,038 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-17 02:53:06,039 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:53:06,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188849635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:06,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:53:06,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 02:53:06,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912784123] [2025-03-17 02:53:06,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:06,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:53:06,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:06,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:53:06,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:53:06,061 INFO L87 Difference]: Start difference. First operand has 50 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 02:53:06,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:06,074 INFO L93 Difference]: Finished difference Result 97 states and 172 transitions. [2025-03-17 02:53:06,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:53:06,077 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 120 [2025-03-17 02:53:06,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:06,083 INFO L225 Difference]: With dead ends: 97 [2025-03-17 02:53:06,084 INFO L226 Difference]: Without dead ends: 48 [2025-03-17 02:53:06,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 121 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-17 02:53:06,089 INFO L435 NwaCegarLoop]: 73 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, 73 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-17 02:53:06,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:53:06,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-17 02:53:06,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-17 02:53:06,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 02:53:06,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 73 transitions. [2025-03-17 02:53:06,117 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 73 transitions. Word has length 120 [2025-03-17 02:53:06,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:06,117 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 73 transitions. [2025-03-17 02:53:06,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 02:53:06,117 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 73 transitions. [2025-03-17 02:53:06,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 02:53:06,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:06,119 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:06,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 02:53:06,324 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-17 02:53:06,324 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:06,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:06,325 INFO L85 PathProgramCache]: Analyzing trace with hash -956939290, now seen corresponding path program 1 times [2025-03-17 02:53:06,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:06,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653962064] [2025-03-17 02:53:06,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:06,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:06,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 02:53:06,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 02:53:06,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:06,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:06,644 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 02:53:06,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:06,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653962064] [2025-03-17 02:53:06,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653962064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:06,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:06,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:53:06,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931381080] [2025-03-17 02:53:06,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:06,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:53:06,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:06,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:53:06,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:53:06,646 INFO L87 Difference]: Start difference. First operand 48 states and 73 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:53:06,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:06,685 INFO L93 Difference]: Finished difference Result 142 states and 217 transitions. [2025-03-17 02:53:06,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:53:06,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 120 [2025-03-17 02:53:06,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:06,689 INFO L225 Difference]: With dead ends: 142 [2025-03-17 02:53:06,689 INFO L226 Difference]: Without dead ends: 95 [2025-03-17 02:53:06,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:53:06,690 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 35 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:06,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 136 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:53:06,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-17 02:53:06,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2025-03-17 02:53:06,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 49 states have internal predecessors, (61), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 02:53:06,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 141 transitions. [2025-03-17 02:53:06,708 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 141 transitions. Word has length 120 [2025-03-17 02:53:06,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:06,709 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 141 transitions. [2025-03-17 02:53:06,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:53:06,709 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 141 transitions. [2025-03-17 02:53:06,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 02:53:06,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:06,710 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:06,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 02:53:06,714 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:06,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:06,714 INFO L85 PathProgramCache]: Analyzing trace with hash -956015769, now seen corresponding path program 1 times [2025-03-17 02:53:06,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:06,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280690240] [2025-03-17 02:53:06,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:06,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:06,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 02:53:06,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 02:53:06,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:06,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:06,944 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 02:53:06,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:06,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280690240] [2025-03-17 02:53:06,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280690240] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:53:06,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450957138] [2025-03-17 02:53:06,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:06,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:53:06,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:53:06,949 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 02:53:06,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 02:53:06,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 02:53:07,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 02:53:07,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:07,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:07,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 02:53:07,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:53:07,382 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 93 proven. 54 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2025-03-17 02:53:07,384 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 02:53:07,636 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 02:53:07,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450957138] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 02:53:07,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 02:53:07,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-17 02:53:07,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835023896] [2025-03-17 02:53:07,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 02:53:07,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 02:53:07,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:07,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 02:53:07,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:53:07,638 INFO L87 Difference]: Start difference. First operand 92 states and 141 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-03-17 02:53:07,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:07,816 INFO L93 Difference]: Finished difference Result 199 states and 295 transitions. [2025-03-17 02:53:07,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 02:53:07,817 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 120 [2025-03-17 02:53:07,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:07,818 INFO L225 Difference]: With dead ends: 199 [2025-03-17 02:53:07,818 INFO L226 Difference]: Without dead ends: 108 [2025-03-17 02:53:07,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 237 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-17 02:53:07,820 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 14 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:07,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 104 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:53:07,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-17 02:53:07,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 100. [2025-03-17 02:53:07,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 55 states have internal predecessors, (65), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 02:53:07,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 145 transitions. [2025-03-17 02:53:07,832 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 145 transitions. Word has length 120 [2025-03-17 02:53:07,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:07,833 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 145 transitions. [2025-03-17 02:53:07,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-03-17 02:53:07,833 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 145 transitions. [2025-03-17 02:53:07,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 02:53:07,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:07,834 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:07,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 02:53:08,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-17 02:53:08,035 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:08,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:08,036 INFO L85 PathProgramCache]: Analyzing trace with hash -955985978, now seen corresponding path program 1 times [2025-03-17 02:53:08,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:08,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10230809] [2025-03-17 02:53:08,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:08,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:08,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 02:53:08,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 02:53:08,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:08,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:09,641 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 02:53:09,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:09,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10230809] [2025-03-17 02:53:09,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10230809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:09,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:09,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 02:53:09,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673609846] [2025-03-17 02:53:09,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:09,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 02:53:09,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:09,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 02:53:09,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:53:09,645 INFO L87 Difference]: Start difference. First operand 100 states and 145 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:53:09,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:09,838 INFO L93 Difference]: Finished difference Result 141 states and 190 transitions. [2025-03-17 02:53:09,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 02:53:09,839 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 120 [2025-03-17 02:53:09,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:09,841 INFO L225 Difference]: With dead ends: 141 [2025-03-17 02:53:09,841 INFO L226 Difference]: Without dead ends: 139 [2025-03-17 02:53:09,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 02:53:09,842 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 30 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:09,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 318 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:53:09,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-17 02:53:09,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 123. [2025-03-17 02:53:09,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 71 states have (on average 1.1408450704225352) internal successors, (81), 72 states have internal predecessors, (81), 44 states have call successors, (44), 7 states have call predecessors, (44), 7 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-17 02:53:09,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 169 transitions. [2025-03-17 02:53:09,864 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 169 transitions. Word has length 120 [2025-03-17 02:53:09,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:09,864 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 169 transitions. [2025-03-17 02:53:09,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:53:09,864 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 169 transitions. [2025-03-17 02:53:09,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 02:53:09,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:09,865 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:09,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 02:53:09,867 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:09,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:09,868 INFO L85 PathProgramCache]: Analyzing trace with hash -428683717, now seen corresponding path program 1 times [2025-03-17 02:53:09,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:09,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101842856] [2025-03-17 02:53:09,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:09,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:09,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 02:53:09,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 02:53:09,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:09,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:10,768 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 02:53:10,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:10,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101842856] [2025-03-17 02:53:10,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101842856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:10,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:10,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 02:53:10,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190070091] [2025-03-17 02:53:10,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:10,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 02:53:10,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:10,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 02:53:10,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:53:10,773 INFO L87 Difference]: Start difference. First operand 123 states and 169 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:53:10,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:10,967 INFO L93 Difference]: Finished difference Result 160 states and 210 transitions. [2025-03-17 02:53:10,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 02:53:10,968 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2025-03-17 02:53:10,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:10,972 INFO L225 Difference]: With dead ends: 160 [2025-03-17 02:53:10,972 INFO L226 Difference]: Without dead ends: 158 [2025-03-17 02:53:10,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 02:53:10,973 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 34 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:10,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 351 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:53:10,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-17 02:53:11,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 127. [2025-03-17 02:53:11,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 75 states have (on average 1.1466666666666667) internal successors, (86), 76 states have internal predecessors, (86), 44 states have call successors, (44), 7 states have call predecessors, (44), 7 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-17 02:53:11,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 174 transitions. [2025-03-17 02:53:11,003 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 174 transitions. Word has length 121 [2025-03-17 02:53:11,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:11,004 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 174 transitions. [2025-03-17 02:53:11,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:53:11,004 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 174 transitions. [2025-03-17 02:53:11,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 02:53:11,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:11,005 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:11,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 02:53:11,005 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:11,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:11,005 INFO L85 PathProgramCache]: Analyzing trace with hash -427760196, now seen corresponding path program 1 times [2025-03-17 02:53:11,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:11,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182385149] [2025-03-17 02:53:11,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:11,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:11,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 02:53:11,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 02:53:11,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:11,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:11,985 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 02:53:11,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:11,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182385149] [2025-03-17 02:53:11,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182385149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:11,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:11,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 02:53:11,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803937821] [2025-03-17 02:53:11,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:11,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 02:53:11,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:11,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 02:53:11,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 02:53:11,988 INFO L87 Difference]: Start difference. First operand 127 states and 174 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:53:12,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:12,224 INFO L93 Difference]: Finished difference Result 150 states and 199 transitions. [2025-03-17 02:53:12,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 02:53:12,224 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2025-03-17 02:53:12,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:12,226 INFO L225 Difference]: With dead ends: 150 [2025-03-17 02:53:12,226 INFO L226 Difference]: Without dead ends: 148 [2025-03-17 02:53:12,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:53:12,226 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 26 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:12,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 442 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:53:12,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-17 02:53:12,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 127. [2025-03-17 02:53:12,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 75 states have (on average 1.1466666666666667) internal successors, (86), 76 states have internal predecessors, (86), 44 states have call successors, (44), 7 states have call predecessors, (44), 7 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-17 02:53:12,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 174 transitions. [2025-03-17 02:53:12,248 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 174 transitions. Word has length 121 [2025-03-17 02:53:12,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:12,248 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 174 transitions. [2025-03-17 02:53:12,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:53:12,249 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 174 transitions. [2025-03-17 02:53:12,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 02:53:12,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:12,251 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:12,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 02:53:12,252 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:12,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:12,252 INFO L85 PathProgramCache]: Analyzing trace with hash -400054566, now seen corresponding path program 1 times [2025-03-17 02:53:12,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:12,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664262789] [2025-03-17 02:53:12,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:12,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:12,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 02:53:12,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 02:53:12,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:12,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:12,840 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 02:53:12,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:12,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664262789] [2025-03-17 02:53:12,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664262789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:12,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:12,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 02:53:12,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782505605] [2025-03-17 02:53:12,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:12,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 02:53:12,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:12,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 02:53:12,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:53:12,842 INFO L87 Difference]: Start difference. First operand 127 states and 174 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:53:12,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:12,984 INFO L93 Difference]: Finished difference Result 158 states and 208 transitions. [2025-03-17 02:53:12,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 02:53:12,984 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2025-03-17 02:53:12,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:12,987 INFO L225 Difference]: With dead ends: 158 [2025-03-17 02:53:12,987 INFO L226 Difference]: Without dead ends: 156 [2025-03-17 02:53:12,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 02:53:12,987 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 30 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:12,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 318 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:53:12,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-17 02:53:13,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 127. [2025-03-17 02:53:13,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 75 states have (on average 1.1466666666666667) internal successors, (86), 76 states have internal predecessors, (86), 44 states have call successors, (44), 7 states have call predecessors, (44), 7 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-17 02:53:13,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 174 transitions. [2025-03-17 02:53:13,010 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 174 transitions. Word has length 121 [2025-03-17 02:53:13,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:13,012 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 174 transitions. [2025-03-17 02:53:13,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:53:13,012 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 174 transitions. [2025-03-17 02:53:13,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 02:53:13,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:13,013 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:13,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 02:53:13,013 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:13,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:13,014 INFO L85 PathProgramCache]: Analyzing trace with hash -399131045, now seen corresponding path program 1 times [2025-03-17 02:53:13,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:13,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765130627] [2025-03-17 02:53:13,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:13,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:13,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 02:53:13,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 02:53:13,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:13,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:14,260 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 02:53:14,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:14,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765130627] [2025-03-17 02:53:14,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765130627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:14,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:14,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 02:53:14,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081276170] [2025-03-17 02:53:14,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:14,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 02:53:14,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:14,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 02:53:14,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 02:53:14,263 INFO L87 Difference]: Start difference. First operand 127 states and 174 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:53:14,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:14,571 INFO L93 Difference]: Finished difference Result 273 states and 369 transitions. [2025-03-17 02:53:14,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 02:53:14,572 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2025-03-17 02:53:14,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:14,573 INFO L225 Difference]: With dead ends: 273 [2025-03-17 02:53:14,573 INFO L226 Difference]: Without dead ends: 271 [2025-03-17 02:53:14,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-17 02:53:14,574 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 60 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:14,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 277 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:53:14,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-03-17 02:53:14,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 247. [2025-03-17 02:53:14,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 144 states have (on average 1.1388888888888888) internal successors, (164), 146 states have internal predecessors, (164), 88 states have call successors, (88), 14 states have call predecessors, (88), 14 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-17 02:53:14,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 340 transitions. [2025-03-17 02:53:14,605 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 340 transitions. Word has length 121 [2025-03-17 02:53:14,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:14,605 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 340 transitions. [2025-03-17 02:53:14,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:53:14,605 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 340 transitions. [2025-03-17 02:53:14,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-17 02:53:14,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:14,606 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:14,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 02:53:14,606 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:14,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:14,607 INFO L85 PathProgramCache]: Analyzing trace with hash -961777528, now seen corresponding path program 1 times [2025-03-17 02:53:14,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:14,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454411806] [2025-03-17 02:53:14,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:14,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:14,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 02:53:14,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 02:53:14,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:14,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:14,638 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 02:53:14,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:14,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454411806] [2025-03-17 02:53:14,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454411806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:14,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:14,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:53:14,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623108958] [2025-03-17 02:53:14,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:14,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:53:14,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:14,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:53:14,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:53:14,640 INFO L87 Difference]: Start difference. First operand 247 states and 340 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:53:14,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:14,664 INFO L93 Difference]: Finished difference Result 270 states and 368 transitions. [2025-03-17 02:53:14,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:53:14,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 122 [2025-03-17 02:53:14,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:14,665 INFO L225 Difference]: With dead ends: 270 [2025-03-17 02:53:14,666 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 02:53:14,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:53:14,667 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 12 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:14,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 141 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:53:14,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 02:53:14,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 02:53:14,667 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-17 02:53:14,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 02:53:14,667 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 122 [2025-03-17 02:53:14,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:14,667 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 02:53:14,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:53:14,667 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 02:53:14,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 02:53:14,670 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 02:53:14,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 02:53:14,674 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:53:14,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 02:53:16,130 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 02:53:16,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:53:16 BoogieIcfgContainer [2025-03-17 02:53:16,146 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 02:53:16,147 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 02:53:16,147 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 02:53:16,147 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 02:53:16,148 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:53:05" (3/4) ... [2025-03-17 02:53:16,149 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 02:53:16,154 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-17 02:53:16,159 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-17 02:53:16,159 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 02:53:16,159 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 02:53:16,159 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 02:53:16,229 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 02:53:16,229 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 02:53:16,229 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 02:53:16,230 INFO L158 Benchmark]: Toolchain (without parser) took 11341.87ms. Allocated memory was 201.3MB in the beginning and 570.4MB in the end (delta: 369.1MB). Free memory was 157.7MB in the beginning and 350.5MB in the end (delta: -192.7MB). Peak memory consumption was 175.8MB. Max. memory is 16.1GB. [2025-03-17 02:53:16,230 INFO L158 Benchmark]: CDTParser took 0.85ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:53:16,230 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.30ms. Allocated memory is still 201.3MB. Free memory was 157.7MB in the beginning and 144.9MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:53:16,231 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.24ms. Allocated memory is still 201.3MB. Free memory was 144.9MB in the beginning and 142.9MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:53:16,231 INFO L158 Benchmark]: Boogie Preprocessor took 31.86ms. Allocated memory is still 201.3MB. Free memory was 142.9MB in the beginning and 140.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:53:16,232 INFO L158 Benchmark]: IcfgBuilder took 323.38ms. Allocated memory is still 201.3MB. Free memory was 140.6MB in the beginning and 124.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 02:53:16,232 INFO L158 Benchmark]: TraceAbstraction took 10611.81ms. Allocated memory was 201.3MB in the beginning and 570.4MB in the end (delta: 369.1MB). Free memory was 123.7MB in the beginning and 358.6MB in the end (delta: -234.9MB). Peak memory consumption was 285.6MB. Max. memory is 16.1GB. [2025-03-17 02:53:16,232 INFO L158 Benchmark]: Witness Printer took 82.08ms. Allocated memory is still 570.4MB. Free memory was 358.6MB in the beginning and 350.5MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:53:16,234 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.85ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.30ms. Allocated memory is still 201.3MB. Free memory was 157.7MB in the beginning and 144.9MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.24ms. Allocated memory is still 201.3MB. Free memory was 144.9MB in the beginning and 142.9MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.86ms. Allocated memory is still 201.3MB. Free memory was 142.9MB in the beginning and 140.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 323.38ms. Allocated memory is still 201.3MB. Free memory was 140.6MB in the beginning and 124.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10611.81ms. Allocated memory was 201.3MB in the beginning and 570.4MB in the end (delta: 369.1MB). Free memory was 123.7MB in the beginning and 358.6MB in the end (delta: -234.9MB). Peak memory consumption was 285.6MB. Max. memory is 16.1GB. * Witness Printer took 82.08ms. Allocated memory is still 570.4MB. Free memory was 358.6MB in the beginning and 350.5MB in the end (delta: 8.1MB). 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, 50 locations, 97 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.1s, OverallIterations: 9, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 241 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 241 mSDsluCounter, 2160 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1488 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 884 IncrementalHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 672 mSDtfsCounter, 884 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 431 GetRequests, 382 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=247occurred in iteration=8, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 132 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 1326 NumberOfCodeBlocks, 1326 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1434 ConstructedInterpolants, 0 QuantifiedInterpolants, 3146 SizeOfPredicates, 1 NumberOfNonLiveVariables, 555 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 8920/9120 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: 108]: Location Invariant Derived location invariant: (((((((var_1_4 == 0) && (((long long) var_1_7 + 1) <= var_1_8)) && (0 <= var_1_1)) && (var_1_1 <= 0)) && (var_1_11 == 1)) || ((((var_1_4 == 0) && (((var_1_11 == 0) && (var_1_5 != 0)) || ((var_1_11 == 1) && (var_1_5 == 0)))) && (0 <= var_1_1)) && (var_1_1 <= 0))) || ((((((((var_1_4 == 0) && (((long long) var_1_7 + 1) <= var_1_8)) && (((var_1_11 == 0) || ((((long long) var_1_9 + var_1_7) + var_1_10) == var_1_6)) || (var_1_9 < 0))) && (var_1_15 == var_1_12)) && (0 <= var_1_1)) && (var_1_1 <= 0)) && (((((long long) var_1_7 + var_1_10) == ((long long) var_1_9 + var_1_6)) || (var_1_11 == 0)) || (0 < ((long long) var_1_9 + 1)))) && ((var_1_11 != 0) || (((long long) var_1_8 + var_1_7) == var_1_6)))) RESULT: Ultimate proved your program to be correct! [2025-03-17 02:53:16,250 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