./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-45.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_fillercode_fillercodestructure_filler-pr-co_file-45.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 015370476ab0be57d23c4c9221d205f96bedfe59bfdbdaa95d44f30adc7a621c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:46:20,410 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:46:20,468 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 01:46:20,476 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:46:20,476 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:46:20,490 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:46:20,490 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:46:20,491 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:46:20,491 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:46:20,491 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:46:20,491 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:46:20,492 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:46:20,493 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:46:20,493 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:46:20,493 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:46:20,493 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:46:20,494 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:46:20,494 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:46:20,494 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 01:46:20,494 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:46:20,494 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:46:20,494 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:46:20,494 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:46:20,495 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:46:20,495 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:46:20,495 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:46:20,495 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:46:20,495 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:46:20,495 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:46:20,495 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:46:20,495 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:46:20,495 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:46:20,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:46:20,496 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:46:20,496 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:46:20,496 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:46:20,496 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:46:20,496 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 01:46:20,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 01:46:20,496 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:46:20,496 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:46:20,496 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:46:20,496 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:46:20,496 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 -> 015370476ab0be57d23c4c9221d205f96bedfe59bfdbdaa95d44f30adc7a621c [2025-03-17 01:46:20,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:46:20,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:46:20,743 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:46:20,744 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:46:20,744 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:46:20,746 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-45.i [2025-03-17 01:46:21,878 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70dd03bf4/9b9e9285bdf140f78a4dca6a2eb3aea9/FLAGbb839ca36 [2025-03-17 01:46:22,161 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:46:22,163 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-45.i [2025-03-17 01:46:22,172 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70dd03bf4/9b9e9285bdf140f78a4dca6a2eb3aea9/FLAGbb839ca36 [2025-03-17 01:46:22,455 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70dd03bf4/9b9e9285bdf140f78a4dca6a2eb3aea9 [2025-03-17 01:46:22,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:46:22,458 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:46:22,459 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:46:22,460 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:46:22,463 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:46:22,463 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:46:22" (1/1) ... [2025-03-17 01:46:22,464 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13b01350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:46:22, skipping insertion in model container [2025-03-17 01:46:22,464 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:46:22" (1/1) ... [2025-03-17 01:46:22,481 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:46:22,584 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_fillercodestructure_filler-pr-co_file-45.i[919,932] [2025-03-17 01:46:22,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:46:22,677 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:46:22,687 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_fillercodestructure_filler-pr-co_file-45.i[919,932] [2025-03-17 01:46:22,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:46:22,747 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:46:22,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:46:22 WrapperNode [2025-03-17 01:46:22,748 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:46:22,750 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:46:22,750 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:46:22,750 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:46:22,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:46:22" (1/1) ... [2025-03-17 01:46:22,767 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:46:22" (1/1) ... [2025-03-17 01:46:22,800 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 216 [2025-03-17 01:46:22,800 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:46:22,801 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:46:22,801 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:46:22,801 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:46:22,807 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:46:22" (1/1) ... [2025-03-17 01:46:22,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:46:22" (1/1) ... [2025-03-17 01:46:22,810 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:46:22" (1/1) ... [2025-03-17 01:46:22,826 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 01:46:22,826 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:46:22" (1/1) ... [2025-03-17 01:46:22,826 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:46:22" (1/1) ... [2025-03-17 01:46:22,836 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:46:22" (1/1) ... [2025-03-17 01:46:22,837 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:46:22" (1/1) ... [2025-03-17 01:46:22,838 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:46:22" (1/1) ... [2025-03-17 01:46:22,839 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:46:22" (1/1) ... [2025-03-17 01:46:22,844 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:46:22,844 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:46:22,844 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:46:22,845 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:46:22,849 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:46:22" (1/1) ... [2025-03-17 01:46:22,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:46:22,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:46:22,873 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 01:46:22,877 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 01:46:22,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:46:22,894 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:46:22,894 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:46:22,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 01:46:22,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:46:22,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:46:22,963 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:46:22,966 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:46:23,270 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-17 01:46:23,271 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:46:23,282 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:46:23,282 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 01:46:23,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:46:23 BoogieIcfgContainer [2025-03-17 01:46:23,283 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:46:23,284 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:46:23,284 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:46:23,287 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:46:23,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:46:22" (1/3) ... [2025-03-17 01:46:23,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5caeb6d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:46:23, skipping insertion in model container [2025-03-17 01:46:23,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:46:22" (2/3) ... [2025-03-17 01:46:23,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5caeb6d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:46:23, skipping insertion in model container [2025-03-17 01:46:23,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:46:23" (3/3) ... [2025-03-17 01:46:23,289 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-45.i [2025-03-17 01:46:23,298 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:46:23,299 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-45.i that has 2 procedures, 91 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:46:23,343 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:46:23,354 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;@344ac86c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:46:23,354 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:46:23,358 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 54 states have internal predecessors, (76), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-17 01:46:23,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-17 01:46:23,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:46:23,370 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:46:23,370 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:46:23,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:46:23,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1217266813, now seen corresponding path program 1 times [2025-03-17 01:46:23,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:46:23,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956506588] [2025-03-17 01:46:23,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:46:23,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:46:23,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-17 01:46:23,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-17 01:46:23,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:46:23,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:46:23,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2025-03-17 01:46:23,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:46:23,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956506588] [2025-03-17 01:46:23,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956506588] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:46:23,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275604210] [2025-03-17 01:46:23,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:46:23,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:46:23,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:46:23,687 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 01:46:23,687 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 01:46:23,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-17 01:46:23,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-17 01:46:23,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:46:23,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:46:23,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:46:23,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:46:23,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2025-03-17 01:46:23,871 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:46:23,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275604210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:46:23,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:46:23,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 01:46:23,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830142288] [2025-03-17 01:46:23,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:46:23,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:46:23,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:46:23,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:46:23,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:46:23,898 INFO L87 Difference]: Start difference. First operand has 91 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 54 states have internal predecessors, (76), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-17 01:46:23,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:46:23,926 INFO L93 Difference]: Finished difference Result 179 states and 325 transitions. [2025-03-17 01:46:23,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:46:23,928 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) Word has length 217 [2025-03-17 01:46:23,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:46:23,934 INFO L225 Difference]: With dead ends: 179 [2025-03-17 01:46:23,934 INFO L226 Difference]: Without dead ends: 89 [2025-03-17 01:46:23,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 218 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 01:46:23,940 INFO L435 NwaCegarLoop]: 142 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, 142 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 01:46:23,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:46:23,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-17 01:46:23,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-17 01:46:23,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 52 states have internal predecessors, (72), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-17 01:46:23,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 142 transitions. [2025-03-17 01:46:23,982 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 142 transitions. Word has length 217 [2025-03-17 01:46:23,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:46:23,982 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 142 transitions. [2025-03-17 01:46:23,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-17 01:46:23,982 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 142 transitions. [2025-03-17 01:46:23,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-17 01:46:23,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:46:23,988 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:46:23,996 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-17 01:46:24,189 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 01:46:24,189 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:46:24,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:46:24,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1330593640, now seen corresponding path program 1 times [2025-03-17 01:46:24,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:46:24,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036161540] [2025-03-17 01:46:24,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:46:24,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:46:24,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-17 01:46:24,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-17 01:46:24,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:46:24,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:46:24,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-17 01:46:24,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:46:24,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036161540] [2025-03-17 01:46:24,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036161540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:46:24,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:46:24,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:46:24,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818952497] [2025-03-17 01:46:24,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:46:24,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:46:24,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:46:24,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:46:24,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:46:24,445 INFO L87 Difference]: Start difference. First operand 89 states and 142 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-17 01:46:24,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:46:24,520 INFO L93 Difference]: Finished difference Result 260 states and 414 transitions. [2025-03-17 01:46:24,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:46:24,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 217 [2025-03-17 01:46:24,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:46:24,523 INFO L225 Difference]: With dead ends: 260 [2025-03-17 01:46:24,523 INFO L226 Difference]: Without dead ends: 172 [2025-03-17 01:46:24,524 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 01:46:24,524 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 124 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:46:24,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 260 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:46:24,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-17 01:46:24,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2025-03-17 01:46:24,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 97 states have (on average 1.309278350515464) internal successors, (127), 97 states have internal predecessors, (127), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-17 01:46:24,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 267 transitions. [2025-03-17 01:46:24,564 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 267 transitions. Word has length 217 [2025-03-17 01:46:24,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:46:24,564 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 267 transitions. [2025-03-17 01:46:24,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-17 01:46:24,565 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 267 transitions. [2025-03-17 01:46:24,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-17 01:46:24,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:46:24,569 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:46:24,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 01:46:24,570 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:46:24,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:46:24,570 INFO L85 PathProgramCache]: Analyzing trace with hash 199025986, now seen corresponding path program 1 times [2025-03-17 01:46:24,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:46:24,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488217572] [2025-03-17 01:46:24,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:46:24,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:46:24,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-17 01:46:24,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-17 01:46:24,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:46:24,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:46:24,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-17 01:46:24,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:46:24,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488217572] [2025-03-17 01:46:24,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488217572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:46:24,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:46:24,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 01:46:24,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491454145] [2025-03-17 01:46:24,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:46:24,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:46:24,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:46:24,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:46:24,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:46:24,775 INFO L87 Difference]: Start difference. First operand 170 states and 267 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-17 01:46:24,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:46:24,828 INFO L93 Difference]: Finished difference Result 433 states and 682 transitions. [2025-03-17 01:46:24,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:46:24,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 219 [2025-03-17 01:46:24,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:46:24,833 INFO L225 Difference]: With dead ends: 433 [2025-03-17 01:46:24,836 INFO L226 Difference]: Without dead ends: 264 [2025-03-17 01:46:24,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:46:24,840 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 88 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:46:24,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 404 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:46:24,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-17 01:46:24,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 256. [2025-03-17 01:46:24,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 147 states have (on average 1.3061224489795917) internal successors, (192), 147 states have internal predecessors, (192), 105 states have call successors, (105), 3 states have call predecessors, (105), 3 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-17 01:46:24,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 402 transitions. [2025-03-17 01:46:24,882 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 402 transitions. Word has length 219 [2025-03-17 01:46:24,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:46:24,882 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 402 transitions. [2025-03-17 01:46:24,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-17 01:46:24,883 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 402 transitions. [2025-03-17 01:46:24,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-17 01:46:24,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:46:24,886 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:46:24,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 01:46:24,887 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:46:24,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:46:24,887 INFO L85 PathProgramCache]: Analyzing trace with hash 2512481, now seen corresponding path program 1 times [2025-03-17 01:46:24,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:46:24,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80990639] [2025-03-17 01:46:24,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:46:24,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:46:24,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-17 01:46:24,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-17 01:46:24,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:46:24,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:46:33,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-17 01:46:33,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:46:33,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80990639] [2025-03-17 01:46:33,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80990639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:46:33,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:46:33,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 01:46:33,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752440112] [2025-03-17 01:46:33,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:46:33,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 01:46:33,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:46:33,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 01:46:33,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:46:33,244 INFO L87 Difference]: Start difference. First operand 256 states and 402 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-17 01:46:33,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:46:33,746 INFO L93 Difference]: Finished difference Result 595 states and 922 transitions. [2025-03-17 01:46:33,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 01:46:33,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 219 [2025-03-17 01:46:33,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:46:33,750 INFO L225 Difference]: With dead ends: 595 [2025-03-17 01:46:33,750 INFO L226 Difference]: Without dead ends: 426 [2025-03-17 01:46:33,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:46:33,751 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 108 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 01:46:33,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 364 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 01:46:33,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-03-17 01:46:33,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 418. [2025-03-17 01:46:33,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 269 states have (on average 1.3643122676579926) internal successors, (367), 273 states have internal predecessors, (367), 141 states have call successors, (141), 7 states have call predecessors, (141), 7 states have return successors, (141), 137 states have call predecessors, (141), 141 states have call successors, (141) [2025-03-17 01:46:33,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 649 transitions. [2025-03-17 01:46:33,803 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 649 transitions. Word has length 219 [2025-03-17 01:46:33,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:46:33,803 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 649 transitions. [2025-03-17 01:46:33,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-17 01:46:33,804 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 649 transitions. [2025-03-17 01:46:33,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-17 01:46:33,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:46:33,806 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:46:33,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 01:46:33,806 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:46:33,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:46:33,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1794438878, now seen corresponding path program 1 times [2025-03-17 01:46:33,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:46:33,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191336944] [2025-03-17 01:46:33,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:46:33,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:46:33,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-17 01:46:33,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-17 01:46:33,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:46:33,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:46:34,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-17 01:46:34,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:46:34,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191336944] [2025-03-17 01:46:34,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191336944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:46:34,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:46:34,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 01:46:34,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291624260] [2025-03-17 01:46:34,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:46:34,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 01:46:34,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:46:34,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 01:46:34,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:46:34,703 INFO L87 Difference]: Start difference. First operand 418 states and 649 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-17 01:46:34,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:46:34,958 INFO L93 Difference]: Finished difference Result 738 states and 1133 transitions. [2025-03-17 01:46:34,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 01:46:34,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 219 [2025-03-17 01:46:34,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:46:34,963 INFO L225 Difference]: With dead ends: 738 [2025-03-17 01:46:34,964 INFO L226 Difference]: Without dead ends: 434 [2025-03-17 01:46:34,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:46:34,965 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 107 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:46:34,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 434 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:46:34,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2025-03-17 01:46:35,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 372. [2025-03-17 01:46:35,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 239 states have (on average 1.3598326359832635) internal successors, (325), 241 states have internal predecessors, (325), 125 states have call successors, (125), 7 states have call predecessors, (125), 7 states have return successors, (125), 123 states have call predecessors, (125), 125 states have call successors, (125) [2025-03-17 01:46:35,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 575 transitions. [2025-03-17 01:46:35,008 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 575 transitions. Word has length 219 [2025-03-17 01:46:35,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:46:35,008 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 575 transitions. [2025-03-17 01:46:35,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-17 01:46:35,009 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 575 transitions. [2025-03-17 01:46:35,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-17 01:46:35,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:46:35,013 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:46:35,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 01:46:35,013 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:46:35,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:46:35,015 INFO L85 PathProgramCache]: Analyzing trace with hash -168607263, now seen corresponding path program 1 times [2025-03-17 01:46:35,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:46:35,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851339549] [2025-03-17 01:46:35,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:46:35,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:46:35,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-17 01:46:35,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-17 01:46:35,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:46:35,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:46:52,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-17 01:46:52,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:46:52,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851339549] [2025-03-17 01:46:52,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851339549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:46:52,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:46:52,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 01:46:52,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861894104] [2025-03-17 01:46:52,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:46:52,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 01:46:52,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:46:52,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 01:46:52,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-17 01:46:52,920 INFO L87 Difference]: Start difference. First operand 372 states and 575 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-17 01:46:55,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:46:55,364 INFO L93 Difference]: Finished difference Result 736 states and 1120 transitions. [2025-03-17 01:46:55,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 01:46:55,364 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 219 [2025-03-17 01:46:55,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:46:55,371 INFO L225 Difference]: With dead ends: 736 [2025-03-17 01:46:55,371 INFO L226 Difference]: Without dead ends: 473 [2025-03-17 01:46:55,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2025-03-17 01:46:55,372 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 179 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 01:46:55,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 821 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 01:46:55,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-03-17 01:46:55,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 409. [2025-03-17 01:46:55,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 274 states have (on average 1.354014598540146) internal successors, (371), 276 states have internal predecessors, (371), 125 states have call successors, (125), 9 states have call predecessors, (125), 9 states have return successors, (125), 123 states have call predecessors, (125), 125 states have call successors, (125) [2025-03-17 01:46:55,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 621 transitions. [2025-03-17 01:46:55,410 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 621 transitions. Word has length 219 [2025-03-17 01:46:55,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:46:55,410 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 621 transitions. [2025-03-17 01:46:55,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-17 01:46:55,411 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 621 transitions. [2025-03-17 01:46:55,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-17 01:46:55,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:46:55,412 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:46:55,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 01:46:55,412 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:46:55,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:46:55,413 INFO L85 PathProgramCache]: Analyzing trace with hash -365120768, now seen corresponding path program 1 times [2025-03-17 01:46:55,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:46:55,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138263463] [2025-03-17 01:46:55,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:46:55,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:46:55,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-17 01:46:55,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-17 01:46:55,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:46:55,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat