./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-31.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_fillercode_fillercodesize_ps-cn-250_file-31.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 210516d030b290bba6a90f31a780a44a85dd399391b1c76362a4e7b38f745547 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:57:13,269 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:57:13,324 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:57:13,328 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:57:13,329 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:57:13,353 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:57:13,354 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:57:13,354 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:57:13,354 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:57:13,354 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:57:13,354 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:57:13,355 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:57:13,355 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:57:13,355 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:57:13,355 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:57:13,355 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:57:13,355 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:57:13,355 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:57:13,355 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:57:13,356 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:57:13,356 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:57:13,356 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:57:13,356 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:57:13,356 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:57:13,356 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:57:13,356 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:57:13,356 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:57:13,356 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:57:13,356 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:57:13,356 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:57:13,356 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:57:13,357 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:57:13,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:57:13,357 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:57:13,357 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:57:13,357 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:57:13,357 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:57:13,357 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:57:13,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:57:13,357 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:57:13,357 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:57:13,357 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:57:13,358 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:57:13,358 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 -> 210516d030b290bba6a90f31a780a44a85dd399391b1c76362a4e7b38f745547 [2025-03-08 10:57:13,618 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:57:13,627 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:57:13,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:57:13,629 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:57:13,629 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:57:13,631 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-31.i [2025-03-08 10:57:14,713 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b1352a42/14ed58c3c46d40d582f9869bc2d3f8fe/FLAG605612c3b [2025-03-08 10:57:15,020 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:57:15,022 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-31.i [2025-03-08 10:57:15,034 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b1352a42/14ed58c3c46d40d582f9869bc2d3f8fe/FLAG605612c3b [2025-03-08 10:57:15,300 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b1352a42/14ed58c3c46d40d582f9869bc2d3f8fe [2025-03-08 10:57:15,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:57:15,304 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:57:15,306 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:57:15,307 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:57:15,310 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:57:15,311 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:57:15" (1/1) ... [2025-03-08 10:57:15,311 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77bb3c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:15, skipping insertion in model container [2025-03-08 10:57:15,311 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:57:15" (1/1) ... [2025-03-08 10:57:15,333 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:57:15,446 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_fillercode_fillercodesize_ps-cn-250_file-31.i[916,929] [2025-03-08 10:57:15,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:57:15,591 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:57:15,603 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_fillercode_fillercodesize_ps-cn-250_file-31.i[916,929] [2025-03-08 10:57:15,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:57:15,682 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:57:15,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:15 WrapperNode [2025-03-08 10:57:15,683 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:57:15,684 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:57:15,684 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:57:15,684 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:57:15,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:15" (1/1) ... [2025-03-08 10:57:15,700 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:15" (1/1) ... [2025-03-08 10:57:15,744 INFO L138 Inliner]: procedures = 26, calls = 83, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 487 [2025-03-08 10:57:15,745 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:57:15,746 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:57:15,746 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:57:15,746 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:57:15,752 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:15" (1/1) ... [2025-03-08 10:57:15,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:15" (1/1) ... [2025-03-08 10:57:15,761 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:15" (1/1) ... [2025-03-08 10:57:15,790 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-08 10:57:15,793 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:15" (1/1) ... [2025-03-08 10:57:15,793 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:15" (1/1) ... [2025-03-08 10:57:15,809 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:15" (1/1) ... [2025-03-08 10:57:15,811 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:15" (1/1) ... [2025-03-08 10:57:15,815 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:15" (1/1) ... [2025-03-08 10:57:15,821 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:15" (1/1) ... [2025-03-08 10:57:15,831 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:57:15,835 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:57:15,835 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:57:15,835 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:57:15,836 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:15" (1/1) ... [2025-03-08 10:57:15,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:57:15,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:57:15,859 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-08 10:57:15,861 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-08 10:57:15,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:57:15,876 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:57:15,876 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:57:15,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:57:15,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:57:15,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:57:15,955 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:57:15,956 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:57:16,616 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-08 10:57:16,617 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:57:16,641 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:57:16,642 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:57:16,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:57:16 BoogieIcfgContainer [2025-03-08 10:57:16,642 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:57:16,644 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:57:16,644 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:57:16,647 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:57:16,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:57:15" (1/3) ... [2025-03-08 10:57:16,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb8383d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:57:16, skipping insertion in model container [2025-03-08 10:57:16,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:15" (2/3) ... [2025-03-08 10:57:16,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb8383d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:57:16, skipping insertion in model container [2025-03-08 10:57:16,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:57:16" (3/3) ... [2025-03-08 10:57:16,649 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-31.i [2025-03-08 10:57:16,659 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:57:16,662 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-31.i that has 2 procedures, 209 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:57:16,715 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:57:16,723 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;@5f8a9096, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:57:16,723 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:57:16,730 INFO L276 IsEmpty]: Start isEmpty. Operand has 209 states, 136 states have (on average 1.5441176470588236) internal successors, (210), 137 states have internal predecessors, (210), 70 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-08 10:57:16,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-03-08 10:57:16,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:16,747 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:57:16,747 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:16,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:16,752 INFO L85 PathProgramCache]: Analyzing trace with hash 880115556, now seen corresponding path program 1 times [2025-03-08 10:57:16,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:16,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418058166] [2025-03-08 10:57:16,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:16,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:16,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-03-08 10:57:16,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-03-08 10:57:16,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:16,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:17,170 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 9522 trivial. 0 not checked. [2025-03-08 10:57:17,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:57:17,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418058166] [2025-03-08 10:57:17,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418058166] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:57:17,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050876598] [2025-03-08 10:57:17,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:17,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:57:17,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:57:17,173 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-08 10:57:17,190 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-08 10:57:17,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-03-08 10:57:17,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-03-08 10:57:17,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:17,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:17,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 996 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:57:17,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:57:17,484 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 9522 trivial. 0 not checked. [2025-03-08 10:57:17,484 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:57:17,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050876598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:57:17,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:57:17,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:57:17,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226731422] [2025-03-08 10:57:17,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:57:17,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:57:17,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:57:17,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:57:17,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:57:17,507 INFO L87 Difference]: Start difference. First operand has 209 states, 136 states have (on average 1.5441176470588236) internal successors, (210), 137 states have internal predecessors, (210), 70 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) Second operand has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 2 states have call successors, (70), 2 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 2 states have call successors, (70) [2025-03-08 10:57:17,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:57:17,547 INFO L93 Difference]: Finished difference Result 412 states and 765 transitions. [2025-03-08 10:57:17,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:57:17,549 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 2 states have call successors, (70), 2 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 2 states have call successors, (70) Word has length 441 [2025-03-08 10:57:17,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:57:17,556 INFO L225 Difference]: With dead ends: 412 [2025-03-08 10:57:17,556 INFO L226 Difference]: Without dead ends: 206 [2025-03-08 10:57:17,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 442 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-08 10:57:17,563 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:57:17,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 337 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:57:17,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-08 10:57:17,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2025-03-08 10:57:17,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 134 states have (on average 1.507462686567164) internal successors, (202), 134 states have internal predecessors, (202), 70 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-08 10:57:17,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 342 transitions. [2025-03-08 10:57:17,605 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 342 transitions. Word has length 441 [2025-03-08 10:57:17,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:57:17,605 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 342 transitions. [2025-03-08 10:57:17,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 2 states have call successors, (70), 2 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 2 states have call successors, (70) [2025-03-08 10:57:17,605 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 342 transitions. [2025-03-08 10:57:17,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2025-03-08 10:57:17,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:17,613 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:57:17,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 10:57:17,814 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-08 10:57:17,815 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:17,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:17,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1553184357, now seen corresponding path program 1 times [2025-03-08 10:57:17,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:17,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845772549] [2025-03-08 10:57:17,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:17,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:17,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-03-08 10:57:17,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-03-08 10:57:17,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:17,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:18,289 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-03-08 10:57:18,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:57:18,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845772549] [2025-03-08 10:57:18,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845772549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:57:18,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:57:18,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:57:18,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194740263] [2025-03-08 10:57:18,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:57:18,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:57:18,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:57:18,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:57:18,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:57:18,295 INFO L87 Difference]: Start difference. First operand 206 states and 342 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-08 10:57:18,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:57:18,373 INFO L93 Difference]: Finished difference Result 612 states and 1020 transitions. [2025-03-08 10:57:18,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:57:18,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 442 [2025-03-08 10:57:18,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:57:18,381 INFO L225 Difference]: With dead ends: 612 [2025-03-08 10:57:18,381 INFO L226 Difference]: Without dead ends: 409 [2025-03-08 10:57:18,383 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-08 10:57:18,384 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 208 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:57:18,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 653 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:57:18,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2025-03-08 10:57:18,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 407. [2025-03-08 10:57:18,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 264 states have (on average 1.5) internal successors, (396), 264 states have internal predecessors, (396), 140 states have call successors, (140), 2 states have call predecessors, (140), 2 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-08 10:57:18,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 676 transitions. [2025-03-08 10:57:18,468 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 676 transitions. Word has length 442 [2025-03-08 10:57:18,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:57:18,471 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 676 transitions. [2025-03-08 10:57:18,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-08 10:57:18,472 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 676 transitions. [2025-03-08 10:57:18,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-03-08 10:57:18,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:18,495 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:57:18,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:57:18,496 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:18,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:18,496 INFO L85 PathProgramCache]: Analyzing trace with hash -695293800, now seen corresponding path program 1 times [2025-03-08 10:57:18,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:18,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665867794] [2025-03-08 10:57:18,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:18,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:18,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-03-08 10:57:18,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-03-08 10:57:18,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:18,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:18,761 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-03-08 10:57:18,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:57:18,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665867794] [2025-03-08 10:57:18,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665867794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:57:18,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:57:18,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:57:18,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283481197] [2025-03-08 10:57:18,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:57:18,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:57:18,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:57:18,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:57:18,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:57:18,763 INFO L87 Difference]: Start difference. First operand 407 states and 676 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-08 10:57:18,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:57:18,851 INFO L93 Difference]: Finished difference Result 1051 states and 1742 transitions. [2025-03-08 10:57:18,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:57:18,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 444 [2025-03-08 10:57:18,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:57:18,858 INFO L225 Difference]: With dead ends: 1051 [2025-03-08 10:57:18,859 INFO L226 Difference]: Without dead ends: 647 [2025-03-08 10:57:18,860 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-08 10:57:18,861 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 186 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:57:18,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 762 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:57:18,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2025-03-08 10:57:18,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 643. [2025-03-08 10:57:18,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 438 states have (on average 1.5022831050228311) internal successors, (658), 440 states have internal predecessors, (658), 200 states have call successors, (200), 4 states have call predecessors, (200), 4 states have return successors, (200), 198 states have call predecessors, (200), 200 states have call successors, (200) [2025-03-08 10:57:18,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1058 transitions. [2025-03-08 10:57:18,955 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1058 transitions. Word has length 444 [2025-03-08 10:57:18,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:57:18,958 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 1058 transitions. [2025-03-08 10:57:18,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-08 10:57:18,960 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1058 transitions. [2025-03-08 10:57:18,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-03-08 10:57:18,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:18,963 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:57:18,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 10:57:18,963 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:18,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:18,964 INFO L85 PathProgramCache]: Analyzing trace with hash -571220553, now seen corresponding path program 1 times [2025-03-08 10:57:18,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:18,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358542649] [2025-03-08 10:57:18,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:18,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:18,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-03-08 10:57:19,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-03-08 10:57:19,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:19,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:19,168 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-03-08 10:57:19,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:57:19,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358542649] [2025-03-08 10:57:19,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358542649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:57:19,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:57:19,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:57:19,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55847198] [2025-03-08 10:57:19,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:57:19,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:57:19,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:57:19,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:57:19,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:57:19,171 INFO L87 Difference]: Start difference. First operand 643 states and 1058 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-08 10:57:19,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:57:19,258 INFO L93 Difference]: Finished difference Result 1297 states and 2126 transitions. [2025-03-08 10:57:19,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:57:19,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 444 [2025-03-08 10:57:19,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:57:19,267 INFO L225 Difference]: With dead ends: 1297 [2025-03-08 10:57:19,268 INFO L226 Difference]: Without dead ends: 657 [2025-03-08 10:57:19,270 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-08 10:57:19,271 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 168 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:57:19,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 693 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:57:19,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2025-03-08 10:57:19,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 517. [2025-03-08 10:57:19,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 372 states have (on average 1.5161290322580645) internal successors, (564), 372 states have internal predecessors, (564), 140 states have call successors, (140), 4 states have call predecessors, (140), 4 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-08 10:57:19,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 844 transitions. [2025-03-08 10:57:19,326 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 844 transitions. Word has length 444 [2025-03-08 10:57:19,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:57:19,326 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 844 transitions. [2025-03-08 10:57:19,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-08 10:57:19,327 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 844 transitions. [2025-03-08 10:57:19,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-03-08 10:57:19,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:19,331 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:57:19,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 10:57:19,332 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:19,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:19,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1076779178, now seen corresponding path program 1 times [2025-03-08 10:57:19,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:19,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631211792] [2025-03-08 10:57:19,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:19,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:19,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-03-08 10:57:19,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-03-08 10:57:19,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:19,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:19,503 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-03-08 10:57:19,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:57:19,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631211792] [2025-03-08 10:57:19,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631211792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:57:19,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:57:19,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:57:19,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60212918] [2025-03-08 10:57:19,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:57:19,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:57:19,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:57:19,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:57:19,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:57:19,508 INFO L87 Difference]: Start difference. First operand 517 states and 844 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-08 10:57:19,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:57:19,601 INFO L93 Difference]: Finished difference Result 1543 states and 2522 transitions. [2025-03-08 10:57:19,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:57:19,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 444 [2025-03-08 10:57:19,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:57:19,608 INFO L225 Difference]: With dead ends: 1543 [2025-03-08 10:57:19,609 INFO L226 Difference]: Without dead ends: 1029 [2025-03-08 10:57:19,611 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-08 10:57:19,612 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 330 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:57:19,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 983 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:57:19,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2025-03-08 10:57:19,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 525. [2025-03-08 10:57:19,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 380 states have (on average 1.5105263157894737) internal successors, (574), 380 states have internal predecessors, (574), 140 states have call successors, (140), 4 states have call predecessors, (140), 4 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-08 10:57:19,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 854 transitions. [2025-03-08 10:57:19,678 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 854 transitions. Word has length 444 [2025-03-08 10:57:19,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:57:19,678 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 854 transitions. [2025-03-08 10:57:19,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-08 10:57:19,679 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 854 transitions. [2025-03-08 10:57:19,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-03-08 10:57:19,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:19,681 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:57:19,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 10:57:19,681 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:19,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:19,682 INFO L85 PathProgramCache]: Analyzing trace with hash 666031157, now seen corresponding path program 1 times [2025-03-08 10:57:19,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:19,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986465672] [2025-03-08 10:57:19,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:19,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:19,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-03-08 10:57:20,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-03-08 10:57:20,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:20,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:25,428 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2025-03-08 10:57:25,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:57:25,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986465672] [2025-03-08 10:57:25,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986465672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:57:25,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:57:25,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 10:57:25,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493930341] [2025-03-08 10:57:25,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:57:25,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 10:57:25,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:57:25,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 10:57:25,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:57:25,431 INFO L87 Difference]: Start difference. First operand 525 states and 854 transitions. Second operand has 11 states, 11 states have (on average 8.818181818181818) internal successors, (97), 11 states have internal predecessors, (97), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-08 10:57:26,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:57:26,123 INFO L93 Difference]: Finished difference Result 1227 states and 1933 transitions. [2025-03-08 10:57:26,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 10:57:26,124 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.818181818181818) internal successors, (97), 11 states have internal predecessors, (97), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) Word has length 444 [2025-03-08 10:57:26,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:57:26,131 INFO L225 Difference]: With dead ends: 1227 [2025-03-08 10:57:26,131 INFO L226 Difference]: Without dead ends: 705 [2025-03-08 10:57:26,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-08 10:57:26,134 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 172 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 10:57:26,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 1403 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 10:57:26,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2025-03-08 10:57:26,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 608. [2025-03-08 10:57:26,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 451 states have (on average 1.4878048780487805) internal successors, (671), 454 states have internal predecessors, (671), 148 states have call successors, (148), 8 states have call predecessors, (148), 8 states have return successors, (148), 145 states have call predecessors, (148), 148 states have call successors, (148) [2025-03-08 10:57:26,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 967 transitions. [2025-03-08 10:57:26,175 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 967 transitions. Word has length 444 [2025-03-08 10:57:26,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:57:26,176 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 967 transitions. [2025-03-08 10:57:26,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.818181818181818) internal successors, (97), 11 states have internal predecessors, (97), 1 states have call successors, (70), 1 states have call predecessors, (70), 1 states have return successors, (70), 1 states have call predecessors, (70), 1 states have call successors, (70) [2025-03-08 10:57:26,176 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 967 transitions. [2025-03-08 10:57:26,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-03-08 10:57:26,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:26,181 INFO L218 NwaCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:57:26,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 10:57:26,182 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:26,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:26,182 INFO L85 PathProgramCache]: Analyzing trace with hash 19265292, now seen corresponding path program 1 times [2025-03-08 10:57:26,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:26,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540110694] [2025-03-08 10:57:26,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:26,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:26,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-03-08 10:57:26,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-03-08 10:57:26,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:26,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat