./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-14.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-14.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 d03dd1fa0ccd6c2f276f8e830c5c45c3023586b3294c63b9f2b76eedbdce4e31 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:54:59,737 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:54:59,783 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:54:59,789 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:54:59,792 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:54:59,812 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:54:59,813 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:54:59,813 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:54:59,813 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:54:59,813 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:54:59,814 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:54:59,814 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:54:59,814 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:54:59,814 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:54:59,814 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:54:59,815 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:54:59,815 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:54:59,815 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:54:59,815 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:54:59,816 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:54:59,816 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:54:59,816 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:54:59,816 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:54:59,816 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:54:59,816 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:54:59,816 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:54:59,816 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:54:59,816 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:54:59,817 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:54:59,817 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:54:59,817 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:54:59,817 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:54:59,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:54:59,817 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:54:59,817 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:54:59,818 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:54:59,818 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:54:59,818 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:54:59,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:54:59,818 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:54:59,818 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:54:59,818 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:54:59,818 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:54:59,818 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 -> d03dd1fa0ccd6c2f276f8e830c5c45c3023586b3294c63b9f2b76eedbdce4e31 [2025-03-08 10:55:00,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:55:00,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:55:00,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:55:00,042 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:55:00,042 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:55:00,044 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-14.i [2025-03-08 10:55:01,316 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0598a52c/2014cfe4e55f4571ab57a0fb49a5eed5/FLAG4be9aaf55 [2025-03-08 10:55:01,562 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:55:01,562 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-14.i [2025-03-08 10:55:01,582 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0598a52c/2014cfe4e55f4571ab57a0fb49a5eed5/FLAG4be9aaf55 [2025-03-08 10:55:01,874 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0598a52c/2014cfe4e55f4571ab57a0fb49a5eed5 [2025-03-08 10:55:01,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:55:01,877 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:55:01,877 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:55:01,878 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:55:01,881 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:55:01,882 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:55:01" (1/1) ... [2025-03-08 10:55:01,883 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d7f33e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:55:01, skipping insertion in model container [2025-03-08 10:55:01,883 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:55:01" (1/1) ... [2025-03-08 10:55:01,922 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:55:02,037 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-14.i[916,929] [2025-03-08 10:55:02,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:55:02,191 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:55:02,200 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-14.i[916,929] [2025-03-08 10:55:02,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:55:02,296 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:55:02,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:55:02 WrapperNode [2025-03-08 10:55:02,297 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:55:02,299 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:55:02,299 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:55:02,299 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:55:02,303 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:55:02" (1/1) ... [2025-03-08 10:55:02,320 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:55:02" (1/1) ... [2025-03-08 10:55:02,381 INFO L138 Inliner]: procedures = 26, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 575 [2025-03-08 10:55:02,381 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:55:02,382 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:55:02,382 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:55:02,382 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:55:02,388 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:55:02" (1/1) ... [2025-03-08 10:55:02,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:55:02" (1/1) ... [2025-03-08 10:55:02,401 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:55:02" (1/1) ... [2025-03-08 10:55:02,432 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:55:02,433 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:55:02" (1/1) ... [2025-03-08 10:55:02,433 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:55:02" (1/1) ... [2025-03-08 10:55:02,457 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:55:02" (1/1) ... [2025-03-08 10:55:02,462 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:55:02" (1/1) ... [2025-03-08 10:55:02,472 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:55:02" (1/1) ... [2025-03-08 10:55:02,476 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:55:02" (1/1) ... [2025-03-08 10:55:02,487 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:55:02,489 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:55:02,490 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:55:02,490 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:55:02,492 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:55:02" (1/1) ... [2025-03-08 10:55:02,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:55:02,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:55:02,518 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:55:02,523 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:55:02,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:55:02,545 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:55:02,545 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:55:02,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:55:02,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:55:02,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:55:02,665 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:55:02,667 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:55:03,431 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-08 10:55:03,431 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:55:03,457 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:55:03,461 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:55:03,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:55:03 BoogieIcfgContainer [2025-03-08 10:55:03,462 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:55:03,463 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:55:03,464 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:55:03,467 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:55:03,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:55:01" (1/3) ... [2025-03-08 10:55:03,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b74f49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:55:03, skipping insertion in model container [2025-03-08 10:55:03,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:55:02" (2/3) ... [2025-03-08 10:55:03,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b74f49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:55:03, skipping insertion in model container [2025-03-08 10:55:03,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:55:03" (3/3) ... [2025-03-08 10:55:03,469 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-14.i [2025-03-08 10:55:03,479 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:55:03,482 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-14.i that has 2 procedures, 250 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:55:03,533 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:55:03,542 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;@302fd819, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:55:03,543 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:55:03,547 INFO L276 IsEmpty]: Start isEmpty. Operand has 250 states, 149 states have (on average 1.516778523489933) internal successors, (226), 150 states have internal predecessors, (226), 98 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-08 10:55:03,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2025-03-08 10:55:03,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:55:03,569 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:03,569 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:55:03,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:55:03,574 INFO L85 PathProgramCache]: Analyzing trace with hash -16663261, now seen corresponding path program 1 times [2025-03-08 10:55:03,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:55:03,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308599436] [2025-03-08 10:55:03,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:03,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:55:03,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 590 statements into 1 equivalence classes. [2025-03-08 10:55:03,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 590 of 590 statements. [2025-03-08 10:55:03,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:03,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:04,036 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 194 refuted. 0 times theorem prover too weak. 18818 trivial. 0 not checked. [2025-03-08 10:55:04,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:55:04,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308599436] [2025-03-08 10:55:04,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308599436] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:55:04,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683039303] [2025-03-08 10:55:04,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:04,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:55:04,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:55:04,040 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:55:04,041 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:55:04,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 590 statements into 1 equivalence classes. [2025-03-08 10:55:04,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 590 of 590 statements. [2025-03-08 10:55:04,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:04,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:04,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 1279 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:55:04,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:55:04,405 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 18818 trivial. 0 not checked. [2025-03-08 10:55:04,406 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:55:04,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683039303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:55:04,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:55:04,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:55:04,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587317796] [2025-03-08 10:55:04,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:55:04,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:55:04,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:55:04,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:55:04,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:55:04,434 INFO L87 Difference]: Start difference. First operand has 250 states, 149 states have (on average 1.516778523489933) internal successors, (226), 150 states have internal predecessors, (226), 98 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) Second operand has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (98), 2 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 2 states have call successors, (98) [2025-03-08 10:55:04,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:55:04,491 INFO L93 Difference]: Finished difference Result 493 states and 935 transitions. [2025-03-08 10:55:04,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:55:04,493 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (98), 2 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 2 states have call successors, (98) Word has length 590 [2025-03-08 10:55:04,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:55:04,499 INFO L225 Difference]: With dead ends: 493 [2025-03-08 10:55:04,499 INFO L226 Difference]: Without dead ends: 246 [2025-03-08 10:55:04,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 591 GetRequests, 591 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:55:04,505 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:55:04,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 405 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:55:04,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-03-08 10:55:04,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2025-03-08 10:55:04,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 146 states have (on average 1.4726027397260273) internal successors, (215), 146 states have internal predecessors, (215), 98 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-08 10:55:04,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 411 transitions. [2025-03-08 10:55:04,572 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 411 transitions. Word has length 590 [2025-03-08 10:55:04,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:55:04,573 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 411 transitions. [2025-03-08 10:55:04,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (98), 2 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 2 states have call successors, (98) [2025-03-08 10:55:04,575 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 411 transitions. [2025-03-08 10:55:04,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2025-03-08 10:55:04,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:55:04,584 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:04,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 10:55:04,785 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:55:04,785 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:55:04,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:55:04,786 INFO L85 PathProgramCache]: Analyzing trace with hash -2013425670, now seen corresponding path program 1 times [2025-03-08 10:55:04,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:55:04,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268224258] [2025-03-08 10:55:04,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:04,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:55:04,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 591 statements into 1 equivalence classes. [2025-03-08 10:55:04,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 591 of 591 statements. [2025-03-08 10:55:04,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:04,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:05,373 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-08 10:55:05,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:55:05,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268224258] [2025-03-08 10:55:05,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268224258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:55:05,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:55:05,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:55:05,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684815764] [2025-03-08 10:55:05,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:55:05,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:55:05,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:55:05,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:55:05,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:55:05,378 INFO L87 Difference]: Start difference. First operand 246 states and 411 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 10:55:05,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:55:05,482 INFO L93 Difference]: Finished difference Result 639 states and 1071 transitions. [2025-03-08 10:55:05,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:55:05,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 591 [2025-03-08 10:55:05,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:55:05,491 INFO L225 Difference]: With dead ends: 639 [2025-03-08 10:55:05,491 INFO L226 Difference]: Without dead ends: 396 [2025-03-08 10:55:05,494 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:55:05,495 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 235 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:55:05,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 850 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:55:05,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-03-08 10:55:05,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 393. [2025-03-08 10:55:05,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 245 states have (on average 1.5020408163265306) internal successors, (368), 246 states have internal predecessors, (368), 145 states have call successors, (145), 2 states have call predecessors, (145), 2 states have return successors, (145), 144 states have call predecessors, (145), 145 states have call successors, (145) [2025-03-08 10:55:05,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 658 transitions. [2025-03-08 10:55:05,559 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 658 transitions. Word has length 591 [2025-03-08 10:55:05,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:55:05,561 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 658 transitions. [2025-03-08 10:55:05,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 10:55:05,562 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 658 transitions. [2025-03-08 10:55:05,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2025-03-08 10:55:05,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:55:05,567 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:05,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:55:05,568 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:55:05,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:55:05,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1978685338, now seen corresponding path program 1 times [2025-03-08 10:55:05,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:55:05,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979913884] [2025-03-08 10:55:05,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:05,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:55:05,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 591 statements into 1 equivalence classes. [2025-03-08 10:55:05,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 591 of 591 statements. [2025-03-08 10:55:05,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:05,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:06,432 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-08 10:55:06,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:55:06,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979913884] [2025-03-08 10:55:06,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979913884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:55:06,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:55:06,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:55:06,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696924898] [2025-03-08 10:55:06,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:55:06,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:55:06,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:55:06,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:55:06,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:55:06,435 INFO L87 Difference]: Start difference. First operand 393 states and 658 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 2 states have call predecessors, (98), 2 states have call successors, (98) [2025-03-08 10:55:07,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:55:07,251 INFO L93 Difference]: Finished difference Result 1563 states and 2623 transitions. [2025-03-08 10:55:07,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:55:07,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 2 states have call predecessors, (98), 2 states have call successors, (98) Word has length 591 [2025-03-08 10:55:07,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:55:07,264 INFO L225 Difference]: With dead ends: 1563 [2025-03-08 10:55:07,264 INFO L226 Difference]: Without dead ends: 1173 [2025-03-08 10:55:07,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 10:55:07,267 INFO L435 NwaCegarLoop]: 808 mSDtfsCounter, 772 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 10:55:07,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 1485 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 10:55:07,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2025-03-08 10:55:07,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1165. [2025-03-08 10:55:07,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1165 states, 723 states have (on average 1.5034578146611342) internal successors, (1087), 726 states have internal predecessors, (1087), 435 states have call successors, (435), 6 states have call predecessors, (435), 6 states have return successors, (435), 432 states have call predecessors, (435), 435 states have call successors, (435) [2025-03-08 10:55:07,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1957 transitions. [2025-03-08 10:55:07,424 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1957 transitions. Word has length 591 [2025-03-08 10:55:07,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:55:07,425 INFO L471 AbstractCegarLoop]: Abstraction has 1165 states and 1957 transitions. [2025-03-08 10:55:07,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 2 states have call predecessors, (98), 2 states have call successors, (98) [2025-03-08 10:55:07,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1957 transitions. [2025-03-08 10:55:07,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2025-03-08 10:55:07,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:55:07,429 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:07,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 10:55:07,429 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:55:07,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:55:07,430 INFO L85 PathProgramCache]: Analyzing trace with hash -32640160, now seen corresponding path program 1 times [2025-03-08 10:55:07,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:55:07,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623718193] [2025-03-08 10:55:07,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:07,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:55:07,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 592 statements into 1 equivalence classes. [2025-03-08 10:55:07,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 592 of 592 statements. [2025-03-08 10:55:07,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:07,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:09,437 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-08 10:55:09,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:55:09,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623718193] [2025-03-08 10:55:09,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623718193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:55:09,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:55:09,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:55:09,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903765160] [2025-03-08 10:55:09,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:55:09,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:55:09,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:55:09,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:55:09,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:55:09,441 INFO L87 Difference]: Start difference. First operand 1165 states and 1957 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 2 states have call predecessors, (98), 2 states have call successors, (98) [2025-03-08 10:55:10,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:55:10,412 INFO L93 Difference]: Finished difference Result 2335 states and 3922 transitions. [2025-03-08 10:55:10,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 10:55:10,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 2 states have call predecessors, (98), 2 states have call successors, (98) Word has length 592 [2025-03-08 10:55:10,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:55:10,424 INFO L225 Difference]: With dead ends: 2335 [2025-03-08 10:55:10,425 INFO L226 Difference]: Without dead ends: 1945 [2025-03-08 10:55:10,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 10:55:10,428 INFO L435 NwaCegarLoop]: 1072 mSDtfsCounter, 938 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 1747 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 10:55:10,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [938 Valid, 1747 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 10:55:10,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1945 states. [2025-03-08 10:55:10,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1945 to 1939. [2025-03-08 10:55:10,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1939 states, 1203 states have (on average 1.5045719035743974) internal successors, (1810), 1208 states have internal predecessors, (1810), 725 states have call successors, (725), 10 states have call predecessors, (725), 10 states have return successors, (725), 720 states have call predecessors, (725), 725 states have call successors, (725) [2025-03-08 10:55:10,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 3260 transitions. [2025-03-08 10:55:10,625 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 3260 transitions. Word has length 592 [2025-03-08 10:55:10,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:55:10,626 INFO L471 AbstractCegarLoop]: Abstraction has 1939 states and 3260 transitions. [2025-03-08 10:55:10,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 2 states have call predecessors, (98), 2 states have call successors, (98) [2025-03-08 10:55:10,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 3260 transitions. [2025-03-08 10:55:10,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2025-03-08 10:55:10,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:55:10,631 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:10,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 10:55:10,631 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:55:10,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:55:10,632 INFO L85 PathProgramCache]: Analyzing trace with hash 2078650209, now seen corresponding path program 1 times [2025-03-08 10:55:10,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:55:10,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087329703] [2025-03-08 10:55:10,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:10,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:55:10,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 592 statements into 1 equivalence classes. [2025-03-08 10:55:10,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 592 of 592 statements. [2025-03-08 10:55:10,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:10,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:11,631 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 267 proven. 24 refuted. 0 times theorem prover too weak. 18721 trivial. 0 not checked. [2025-03-08 10:55:11,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:55:11,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087329703] [2025-03-08 10:55:11,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087329703] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:55:11,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897961051] [2025-03-08 10:55:11,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:11,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:55:11,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:55:11,634 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:55:11,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 10:55:11,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 592 statements into 1 equivalence classes. [2025-03-08 10:55:11,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 592 of 592 statements. [2025-03-08 10:55:11,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:11,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:11,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 1284 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 10:55:11,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:55:12,072 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 2797 proven. 21 refuted. 0 times theorem prover too weak. 16194 trivial. 0 not checked. [2025-03-08 10:55:12,073 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:55:12,457 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 270 proven. 21 refuted. 0 times theorem prover too weak. 18721 trivial. 0 not checked. [2025-03-08 10:55:12,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897961051] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 10:55:12,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 10:55:12,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-08 10:55:12,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427078098] [2025-03-08 10:55:12,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 10:55:12,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 10:55:12,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:55:12,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 10:55:12,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 10:55:12,460 INFO L87 Difference]: Start difference. First operand 1939 states and 3260 transitions. Second operand has 9 states, 9 states have (on average 20.444444444444443) internal successors, (184), 9 states have internal predecessors, (184), 4 states have call successors, (113), 2 states have call predecessors, (113), 4 states have return successors, (115), 4 states have call predecessors, (115), 4 states have call successors, (115) [2025-03-08 10:55:13,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:55:13,331 INFO L93 Difference]: Finished difference Result 3945 states and 6577 transitions. [2025-03-08 10:55:13,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 10:55:13,332 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 20.444444444444443) internal successors, (184), 9 states have internal predecessors, (184), 4 states have call successors, (113), 2 states have call predecessors, (113), 4 states have return successors, (115), 4 states have call predecessors, (115), 4 states have call successors, (115) Word has length 592 [2025-03-08 10:55:13,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:55:13,349 INFO L225 Difference]: With dead ends: 3945 [2025-03-08 10:55:13,349 INFO L226 Difference]: Without dead ends: 2009 [2025-03-08 10:55:13,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1197 GetRequests, 1181 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2025-03-08 10:55:13,360 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 710 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 726 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 726 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 10:55:13,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 690 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [726 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 10:55:13,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2009 states. [2025-03-08 10:55:13,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2009 to 1979. [2025-03-08 10:55:13,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1979 states, 1233 states have (on average 1.467964314679643) internal successors, (1810), 1238 states have internal predecessors, (1810), 725 states have call successors, (725), 20 states have call predecessors, (725), 20 states have return successors, (725), 720 states have call predecessors, (725), 725 states have call successors, (725) [2025-03-08 10:55:13,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1979 states to 1979 states and 3260 transitions. [2025-03-08 10:55:13,572 INFO L78 Accepts]: Start accepts. Automaton has 1979 states and 3260 transitions. Word has length 592 [2025-03-08 10:55:13,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:55:13,573 INFO L471 AbstractCegarLoop]: Abstraction has 1979 states and 3260 transitions. [2025-03-08 10:55:13,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.444444444444443) internal successors, (184), 9 states have internal predecessors, (184), 4 states have call successors, (113), 2 states have call predecessors, (113), 4 states have return successors, (115), 4 states have call predecessors, (115), 4 states have call successors, (115) [2025-03-08 10:55:13,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1979 states and 3260 transitions. [2025-03-08 10:55:13,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2025-03-08 10:55:13,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:55:13,578 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:13,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 10:55:13,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:55:13,780 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:55:13,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:55:13,780 INFO L85 PathProgramCache]: Analyzing trace with hash 288307075, now seen corresponding path program 1 times [2025-03-08 10:55:13,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:55:13,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821442706] [2025-03-08 10:55:13,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:13,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:55:13,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 592 statements into 1 equivalence classes. [2025-03-08 10:55:13,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 592 of 592 statements. [2025-03-08 10:55:13,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:13,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:14,625 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 156 proven. 135 refuted. 0 times theorem prover too weak. 18721 trivial. 0 not checked. [2025-03-08 10:55:14,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:55:14,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821442706] [2025-03-08 10:55:14,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821442706] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:55:14,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49901945] [2025-03-08 10:55:14,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:14,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:55:14,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:55:14,628 INFO L229 MonitoredProcess]: Starting monitored process 4 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:55:14,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 10:55:14,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 592 statements into 1 equivalence classes. [2025-03-08 10:55:14,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 592 of 592 statements. [2025-03-08 10:55:14,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:14,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:14,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 10:55:14,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:55:15,356 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 9561 proven. 135 refuted. 0 times theorem prover too weak. 9316 trivial. 0 not checked. [2025-03-08 10:55:15,356 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:55:15,887 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 156 proven. 135 refuted. 0 times theorem prover too weak. 18721 trivial. 0 not checked. [2025-03-08 10:55:15,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49901945] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 10:55:15,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 10:55:15,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-08 10:55:15,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146551735] [2025-03-08 10:55:15,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 10:55:15,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 10:55:15,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:55:15,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 10:55:15,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:55:15,890 INFO L87 Difference]: Start difference. First operand 1979 states and 3260 transitions. Second operand has 11 states, 11 states have (on average 12.0) internal successors, (132), 11 states have internal predecessors, (132), 2 states have call successors, (143), 2 states have call predecessors, (143), 4 states have return successors, (144), 2 states have call predecessors, (144), 2 states have call successors, (144) [2025-03-08 10:55:18,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:55:18,967 INFO L93 Difference]: Finished difference Result 5927 states and 9694 transitions. [2025-03-08 10:55:18,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-08 10:55:18,968 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 12.0) internal successors, (132), 11 states have internal predecessors, (132), 2 states have call successors, (143), 2 states have call predecessors, (143), 4 states have return successors, (144), 2 states have call predecessors, (144), 2 states have call successors, (144) Word has length 592 [2025-03-08 10:55:18,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:55:18,996 INFO L225 Difference]: With dead ends: 5927 [2025-03-08 10:55:18,996 INFO L226 Difference]: Without dead ends: 3951 [2025-03-08 10:55:19,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1215 GetRequests, 1182 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=295, Invalid=761, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 10:55:19,005 INFO L435 NwaCegarLoop]: 899 mSDtfsCounter, 1278 mSDsluCounter, 2842 mSDsCounter, 0 mSdLazyCounter, 2946 mSolverCounterSat, 745 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1332 SdHoareTripleChecker+Valid, 3741 SdHoareTripleChecker+Invalid, 3691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 745 IncrementalHoareTripleChecker+Valid, 2946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 10:55:19,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1332 Valid, 3741 Invalid, 3691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [745 Valid, 2946 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 10:55:19,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2025-03-08 10:55:19,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 3486. [2025-03-08 10:55:19,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3486 states, 2176 states have (on average 1.455422794117647) internal successors, (3167), 2186 states have internal predecessors, (3167), 1266 states have call successors, (1266), 43 states have call predecessors, (1266), 43 states have return successors, (1266), 1256 states have call predecessors, (1266), 1266 states have call successors, (1266) [2025-03-08 10:55:19,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 3486 states and 5699 transitions. [2025-03-08 10:55:19,422 INFO L78 Accepts]: Start accepts. Automaton has 3486 states and 5699 transitions. Word has length 592 [2025-03-08 10:55:19,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:55:19,423 INFO L471 AbstractCegarLoop]: Abstraction has 3486 states and 5699 transitions. [2025-03-08 10:55:19,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.0) internal successors, (132), 11 states have internal predecessors, (132), 2 states have call successors, (143), 2 states have call predecessors, (143), 4 states have return successors, (144), 2 states have call predecessors, (144), 2 states have call successors, (144) [2025-03-08 10:55:19,424 INFO L276 IsEmpty]: Start isEmpty. Operand 3486 states and 5699 transitions. [2025-03-08 10:55:19,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2025-03-08 10:55:19,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:55:19,428 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:19,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 10:55:19,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:55:19,632 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:55:19,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:55:19,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1030342183, now seen corresponding path program 1 times [2025-03-08 10:55:19,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:55:19,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679008762] [2025-03-08 10:55:19,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:19,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:55:19,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 592 statements into 1 equivalence classes. [2025-03-08 10:55:19,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 592 of 592 statements. [2025-03-08 10:55:19,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:19,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:20,551 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-08 10:55:20,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:55:20,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679008762] [2025-03-08 10:55:20,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679008762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:55:20,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:55:20,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:55:20,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717286404] [2025-03-08 10:55:20,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:55:20,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:55:20,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:55:20,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:55:20,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:55:20,554 INFO L87 Difference]: Start difference. First operand 3486 states and 5699 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 10:55:22,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:55:22,138 INFO L93 Difference]: Finished difference Result 7945 states and 12998 transitions. [2025-03-08 10:55:22,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 10:55:22,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 592 [2025-03-08 10:55:22,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:55:22,162 INFO L225 Difference]: With dead ends: 7945 [2025-03-08 10:55:22,163 INFO L226 Difference]: Without dead ends: 4462 [2025-03-08 10:55:22,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:55:22,175 INFO L435 NwaCegarLoop]: 966 mSDtfsCounter, 627 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 1908 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 10:55:22,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 1908 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 10:55:22,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4462 states. [2025-03-08 10:55:22,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4462 to 4444. [2025-03-08 10:55:22,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4444 states, 2782 states have (on average 1.4583033788641264) internal successors, (4057), 2797 states have internal predecessors, (4057), 1609 states have call successors, (1609), 52 states have call predecessors, (1609), 52 states have return successors, (1609), 1594 states have call predecessors, (1609), 1609 states have call successors, (1609) [2025-03-08 10:55:22,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4444 states to 4444 states and 7275 transitions. [2025-03-08 10:55:22,684 INFO L78 Accepts]: Start accepts. Automaton has 4444 states and 7275 transitions. Word has length 592 [2025-03-08 10:55:22,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:55:22,684 INFO L471 AbstractCegarLoop]: Abstraction has 4444 states and 7275 transitions. [2025-03-08 10:55:22,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 10:55:22,685 INFO L276 IsEmpty]: Start isEmpty. Operand 4444 states and 7275 transitions. [2025-03-08 10:55:22,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2025-03-08 10:55:22,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:55:22,697 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:22,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 10:55:22,697 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:55:22,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:55:22,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1314324858, now seen corresponding path program 1 times [2025-03-08 10:55:22,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:55:22,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846731643] [2025-03-08 10:55:22,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:22,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:55:22,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 592 statements into 1 equivalence classes. [2025-03-08 10:55:22,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 592 of 592 statements. [2025-03-08 10:55:22,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:22,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:23,373 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 201 proven. 90 refuted. 0 times theorem prover too weak. 18721 trivial. 0 not checked. [2025-03-08 10:55:23,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:55:23,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846731643] [2025-03-08 10:55:23,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846731643] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:55:23,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13256336] [2025-03-08 10:55:23,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:23,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:55:23,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:55:23,376 INFO L229 MonitoredProcess]: Starting monitored process 5 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:55:23,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 10:55:23,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 592 statements into 1 equivalence classes. [2025-03-08 10:55:23,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 592 of 592 statements. [2025-03-08 10:55:23,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:23,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:23,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 1279 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 10:55:23,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:55:25,253 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 11633 proven. 309 refuted. 0 times theorem prover too weak. 7070 trivial. 0 not checked. [2025-03-08 10:55:25,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:55:25,876 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 201 proven. 90 refuted. 0 times theorem prover too weak. 18721 trivial. 0 not checked. [2025-03-08 10:55:25,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13256336] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 10:55:25,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 10:55:25,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 7] total 21 [2025-03-08 10:55:25,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985031878] [2025-03-08 10:55:25,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 10:55:25,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 10:55:25,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:55:25,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 10:55:25,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2025-03-08 10:55:25,880 INFO L87 Difference]: Start difference. First operand 4444 states and 7275 transitions. Second operand has 21 states, 21 states have (on average 10.095238095238095) internal successors, (212), 20 states have internal predecessors, (212), 6 states have call successors, (175), 4 states have call predecessors, (175), 7 states have return successors, (177), 6 states have call predecessors, (177), 6 states have call successors, (177) [2025-03-08 10:55:31,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:55:31,142 INFO L93 Difference]: Finished difference Result 26305 states and 42439 transitions. [2025-03-08 10:55:31,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2025-03-08 10:55:31,143 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 10.095238095238095) internal successors, (212), 20 states have internal predecessors, (212), 6 states have call successors, (175), 4 states have call predecessors, (175), 7 states have return successors, (177), 6 states have call predecessors, (177), 6 states have call successors, (177) Word has length 592 [2025-03-08 10:55:31,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:55:31,256 INFO L225 Difference]: With dead ends: 26305 [2025-03-08 10:55:31,256 INFO L226 Difference]: Without dead ends: 21864 [2025-03-08 10:55:31,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1254 GetRequests, 1176 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2139 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1417, Invalid=4903, Unknown=0, NotChecked=0, Total=6320 [2025-03-08 10:55:31,277 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 2138 mSDsluCounter, 2182 mSDsCounter, 0 mSdLazyCounter, 2797 mSolverCounterSat, 1838 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2255 SdHoareTripleChecker+Valid, 2733 SdHoareTripleChecker+Invalid, 4635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1838 IncrementalHoareTripleChecker+Valid, 2797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-08 10:55:31,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2255 Valid, 2733 Invalid, 4635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1838 Valid, 2797 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-08 10:55:31,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21864 states. [2025-03-08 10:55:33,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21864 to 21315. [2025-03-08 10:55:33,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21315 states, 13456 states have (on average 1.4436682520808561) internal successors, (19426), 13549 states have internal predecessors, (19426), 7487 states have call successors, (7487), 371 states have call predecessors, (7487), 371 states have return successors, (7487), 7394 states have call predecessors, (7487), 7487 states have call successors, (7487) [2025-03-08 10:55:34,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21315 states to 21315 states and 34400 transitions. [2025-03-08 10:55:34,027 INFO L78 Accepts]: Start accepts. Automaton has 21315 states and 34400 transitions. Word has length 592 [2025-03-08 10:55:34,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:55:34,028 INFO L471 AbstractCegarLoop]: Abstraction has 21315 states and 34400 transitions. [2025-03-08 10:55:34,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 10.095238095238095) internal successors, (212), 20 states have internal predecessors, (212), 6 states have call successors, (175), 4 states have call predecessors, (175), 7 states have return successors, (177), 6 states have call predecessors, (177), 6 states have call successors, (177) [2025-03-08 10:55:34,029 INFO L276 IsEmpty]: Start isEmpty. Operand 21315 states and 34400 transitions. [2025-03-08 10:55:34,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2025-03-08 10:55:34,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:55:34,040 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:34,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 10:55:34,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:55:34,248 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:55:34,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:55:34,249 INFO L85 PathProgramCache]: Analyzing trace with hash 209491366, now seen corresponding path program 1 times [2025-03-08 10:55:34,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:55:34,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830636230] [2025-03-08 10:55:34,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:34,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:55:34,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-03-08 10:55:34,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-03-08 10:55:34,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:34,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:34,457 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-08 10:55:34,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:55:34,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830636230] [2025-03-08 10:55:34,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830636230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:55:34,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:55:34,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:55:34,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351064469] [2025-03-08 10:55:34,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:55:34,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:55:34,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:55:34,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:55:34,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:55:34,460 INFO L87 Difference]: Start difference. First operand 21315 states and 34400 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 10:55:37,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:55:37,202 INFO L93 Difference]: Finished difference Result 51738 states and 83448 transitions. [2025-03-08 10:55:37,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:55:37,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 593 [2025-03-08 10:55:37,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:55:37,347 INFO L225 Difference]: With dead ends: 51738 [2025-03-08 10:55:37,347 INFO L226 Difference]: Without dead ends: 30426 [2025-03-08 10:55:37,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:55:37,411 INFO L435 NwaCegarLoop]: 788 mSDtfsCounter, 390 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:55:37,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 1175 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:55:37,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30426 states. [2025-03-08 10:55:40,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30426 to 30415. [2025-03-08 10:55:40,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30415 states, 19168 states have (on average 1.4380217028380635) internal successors, (27564), 19291 states have internal predecessors, (27564), 10705 states have call successors, (10705), 541 states have call predecessors, (10705), 541 states have return successors, (10705), 10582 states have call predecessors, (10705), 10705 states have call successors, (10705) [2025-03-08 10:55:41,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30415 states to 30415 states and 48974 transitions. [2025-03-08 10:55:41,072 INFO L78 Accepts]: Start accepts. Automaton has 30415 states and 48974 transitions. Word has length 593 [2025-03-08 10:55:41,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:55:41,073 INFO L471 AbstractCegarLoop]: Abstraction has 30415 states and 48974 transitions. [2025-03-08 10:55:41,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 10:55:41,073 INFO L276 IsEmpty]: Start isEmpty. Operand 30415 states and 48974 transitions. [2025-03-08 10:55:41,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2025-03-08 10:55:41,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:55:41,086 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:41,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 10:55:41,086 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:55:41,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:55:41,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1491249113, now seen corresponding path program 1 times [2025-03-08 10:55:41,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:55:41,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668122944] [2025-03-08 10:55:41,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:41,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:55:41,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-03-08 10:55:41,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-03-08 10:55:41,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:41,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:41,493 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-08 10:55:41,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:55:41,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668122944] [2025-03-08 10:55:41,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668122944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:55:41,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:55:41,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:55:41,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194551707] [2025-03-08 10:55:41,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:55:41,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:55:41,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:55:41,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:55:41,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:55:41,494 INFO L87 Difference]: Start difference. First operand 30415 states and 48974 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 10:55:46,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:55:46,471 INFO L93 Difference]: Finished difference Result 88344 states and 142330 transitions. [2025-03-08 10:55:46,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:55:46,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 593 [2025-03-08 10:55:46,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:55:46,758 INFO L225 Difference]: With dead ends: 88344 [2025-03-08 10:55:46,759 INFO L226 Difference]: Without dead ends: 57932 [2025-03-08 10:55:46,866 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-08 10:55:46,866 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 755 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 10:55:46,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 1058 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 10:55:46,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57932 states. [2025-03-08 10:55:52,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57932 to 52504. [2025-03-08 10:55:52,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52504 states, 33093 states have (on average 1.4369201946030883) internal successors, (47552), 33300 states have internal predecessors, (47552), 18471 states have call successors, (18471), 939 states have call predecessors, (18471), 939 states have return successors, (18471), 18264 states have call predecessors, (18471), 18471 states have call successors, (18471) [2025-03-08 10:55:52,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52504 states to 52504 states and 84494 transitions. [2025-03-08 10:55:52,767 INFO L78 Accepts]: Start accepts. Automaton has 52504 states and 84494 transitions. Word has length 593 [2025-03-08 10:55:52,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:55:52,767 INFO L471 AbstractCegarLoop]: Abstraction has 52504 states and 84494 transitions. [2025-03-08 10:55:52,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 10:55:52,768 INFO L276 IsEmpty]: Start isEmpty. Operand 52504 states and 84494 transitions. [2025-03-08 10:55:52,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2025-03-08 10:55:52,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:55:52,780 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:52,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 10:55:52,780 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:55:52,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:55:52,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1791165901, now seen corresponding path program 1 times [2025-03-08 10:55:52,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:55:52,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249376726] [2025-03-08 10:55:52,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:52,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:55:52,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-03-08 10:55:52,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-03-08 10:55:52,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:52,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 10:55:52,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2064563738] [2025-03-08 10:55:52,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:52,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:55:52,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:55:52,960 INFO L229 MonitoredProcess]: Starting monitored process 6 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:55:52,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 10:55:53,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-03-08 10:55:53,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-03-08 10:55:53,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:53,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:53,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 1281 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 10:55:53,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:55:54,307 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 6297 proven. 231 refuted. 0 times theorem prover too weak. 12484 trivial. 0 not checked. [2025-03-08 10:55:54,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:55:55,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:55:55,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249376726] [2025-03-08 10:55:55,038 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 10:55:55,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064563738] [2025-03-08 10:55:55,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064563738] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:55:55,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:55:55,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-03-08 10:55:55,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390090659] [2025-03-08 10:55:55,038 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 10:55:55,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 10:55:55,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:55:55,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 10:55:55,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-08 10:55:55,039 INFO L87 Difference]: Start difference. First operand 52504 states and 84494 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 6 states have internal predecessors, (112), 2 states have call successors, (98), 2 states have call predecessors, (98), 3 states have return successors, (98), 2 states have call predecessors, (98), 2 states have call successors, (98) [2025-03-08 10:56:04,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:56:04,911 INFO L93 Difference]: Finished difference Result 161680 states and 257092 transitions. [2025-03-08 10:56:04,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 10:56:04,912 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 6 states have internal predecessors, (112), 2 states have call successors, (98), 2 states have call predecessors, (98), 3 states have return successors, (98), 2 states have call predecessors, (98), 2 states have call successors, (98) Word has length 593 [2025-03-08 10:56:04,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:56:05,453 INFO L225 Difference]: With dead ends: 161680 [2025-03-08 10:56:05,453 INFO L226 Difference]: Without dead ends: 109179 [2025-03-08 10:56:05,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 647 GetRequests, 634 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2025-03-08 10:56:05,631 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 282 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 10:56:05,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1294 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 10:56:05,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109179 states.