./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-62.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-62.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 27e3db96087016563da30207a4bc580eb5ca4919334b247fd90d3739cc25722a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:14:33,332 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:14:33,382 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:14:33,386 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:14:33,389 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:14:33,411 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:14:33,412 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:14:33,412 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:14:33,412 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:14:33,413 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:14:33,413 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:14:33,414 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:14:33,414 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:14:33,414 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:14:33,414 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:14:33,414 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:14:33,414 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:14:33,414 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:14:33,414 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:14:33,414 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:14:33,414 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:14:33,415 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:14:33,415 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:14:33,415 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:14:33,415 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:14:33,415 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:14:33,415 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:14:33,415 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:14:33,415 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:14:33,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:14:33,416 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:14:33,416 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:14:33,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:14:33,416 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:14:33,416 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:14:33,416 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:14:33,416 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:14:33,417 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:14:33,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:14:33,417 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:14:33,417 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:14:33,417 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:14:33,417 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:14:33,417 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 -> 27e3db96087016563da30207a4bc580eb5ca4919334b247fd90d3739cc25722a [2025-03-17 05:14:33,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:14:33,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:14:33,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:14:33,645 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:14:33,646 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:14:33,646 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-62.i [2025-03-17 05:14:34,750 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a4231924/a21b535860eb4dc5a8b00da4fd23cfdc/FLAG2183af39b [2025-03-17 05:14:34,984 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:14:34,998 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-62.i [2025-03-17 05:14:35,017 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a4231924/a21b535860eb4dc5a8b00da4fd23cfdc/FLAG2183af39b [2025-03-17 05:14:35,311 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a4231924/a21b535860eb4dc5a8b00da4fd23cfdc [2025-03-17 05:14:35,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:14:35,314 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:14:35,315 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:14:35,315 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:14:35,317 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:14:35,318 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:14:35" (1/1) ... [2025-03-17 05:14:35,319 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e292863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:35, skipping insertion in model container [2025-03-17 05:14:35,319 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:14:35" (1/1) ... [2025-03-17 05:14:35,330 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:14:35,418 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_variablewrapping_normal_file-62.i[913,926] [2025-03-17 05:14:35,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:14:35,452 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:14:35,462 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_variablewrapping_normal_file-62.i[913,926] [2025-03-17 05:14:35,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:14:35,489 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:14:35,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:35 WrapperNode [2025-03-17 05:14:35,490 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:14:35,491 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:14:35,491 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:14:35,491 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:14:35,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:35" (1/1) ... [2025-03-17 05:14:35,501 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:35" (1/1) ... [2025-03-17 05:14:35,522 INFO L138 Inliner]: procedures = 26, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2025-03-17 05:14:35,523 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:14:35,523 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:14:35,523 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:14:35,523 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:14:35,531 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:35" (1/1) ... [2025-03-17 05:14:35,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:35" (1/1) ... [2025-03-17 05:14:35,534 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:35" (1/1) ... [2025-03-17 05:14:35,552 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 05:14:35,553 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:35" (1/1) ... [2025-03-17 05:14:35,553 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:35" (1/1) ... [2025-03-17 05:14:35,556 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:35" (1/1) ... [2025-03-17 05:14:35,559 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:35" (1/1) ... [2025-03-17 05:14:35,560 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:35" (1/1) ... [2025-03-17 05:14:35,564 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:35" (1/1) ... [2025-03-17 05:14:35,565 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:14:35,566 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:14:35,566 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:14:35,566 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:14:35,567 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:35" (1/1) ... [2025-03-17 05:14:35,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:14:35,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:14:35,599 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:14:35,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:14:35,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:14:35,623 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:14:35,623 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:14:35,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:14:35,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:14:35,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:14:35,677 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:14:35,679 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:14:35,865 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 05:14:35,867 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:14:35,874 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:14:35,876 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:14:35,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:14:35 BoogieIcfgContainer [2025-03-17 05:14:35,876 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:14:35,878 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:14:35,878 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:14:35,881 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:14:35,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:14:35" (1/3) ... [2025-03-17 05:14:35,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78c3378c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:14:35, skipping insertion in model container [2025-03-17 05:14:35,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:14:35" (2/3) ... [2025-03-17 05:14:35,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78c3378c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:14:35, skipping insertion in model container [2025-03-17 05:14:35,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:14:35" (3/3) ... [2025-03-17 05:14:35,883 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-62.i [2025-03-17 05:14:35,893 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:14:35,895 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-62.i that has 2 procedures, 34 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:14:35,934 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:14:35,941 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;@57ba1cf8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:14:35,942 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:14:35,946 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 05:14:35,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-17 05:14:35,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:14:35,951 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:14:35,951 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:14:35,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:14:35,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1709713587, now seen corresponding path program 1 times [2025-03-17 05:14:35,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:14:35,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777049059] [2025-03-17 05:14:35,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:14:35,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:14:36,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 05:14:36,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 05:14:36,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:14:36,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:14:36,138 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-17 05:14:36,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:14:36,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777049059] [2025-03-17 05:14:36,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777049059] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:14:36,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43745096] [2025-03-17 05:14:36,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:14:36,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:14:36,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:14:36,143 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:14:36,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:14:36,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 05:14:36,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 05:14:36,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:14:36,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:14:36,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:14:36,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:14:36,238 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-17 05:14:36,240 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:14:36,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43745096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:14:36,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:14:36,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:14:36,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041883311] [2025-03-17 05:14:36,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:14:36,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:14:36,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:14:36,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:14:36,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:14:36,258 INFO L87 Difference]: Start difference. First operand has 34 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 05:14:36,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:14:36,269 INFO L93 Difference]: Finished difference Result 65 states and 106 transitions. [2025-03-17 05:14:36,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:14:36,270 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 54 [2025-03-17 05:14:36,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:14:36,274 INFO L225 Difference]: With dead ends: 65 [2025-03-17 05:14:36,274 INFO L226 Difference]: Without dead ends: 32 [2025-03-17 05:14:36,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:14:36,277 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:14:36,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:14:36,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-17 05:14:36,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-17 05:14:36,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 05:14:36,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2025-03-17 05:14:36,300 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 54 [2025-03-17 05:14:36,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:14:36,300 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2025-03-17 05:14:36,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 05:14:36,300 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2025-03-17 05:14:36,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-17 05:14:36,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:14:36,303 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:14:36,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 05:14:36,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:14:36,506 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:14:36,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:14:36,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1075765427, now seen corresponding path program 1 times [2025-03-17 05:14:36,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:14:36,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444126539] [2025-03-17 05:14:36,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:14:36,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:14:36,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 05:14:36,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 05:14:36,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:14:36,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:14:38,039 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:14:38,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:14:38,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444126539] [2025-03-17 05:14:38,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444126539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:14:38,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:14:38,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:14:38,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614942835] [2025-03-17 05:14:38,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:14:38,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:14:38,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:14:38,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:14:38,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:14:38,041 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:14:38,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:14:38,250 INFO L93 Difference]: Finished difference Result 89 states and 125 transitions. [2025-03-17 05:14:38,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:14:38,251 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 54 [2025-03-17 05:14:38,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:14:38,254 INFO L225 Difference]: With dead ends: 89 [2025-03-17 05:14:38,255 INFO L226 Difference]: Without dead ends: 58 [2025-03-17 05:14:38,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:14:38,257 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 25 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:14:38,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 208 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:14:38,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-17 05:14:38,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2025-03-17 05:14:38,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 states have internal predecessors, (39), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 05:14:38,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2025-03-17 05:14:38,270 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 54 [2025-03-17 05:14:38,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:14:38,271 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2025-03-17 05:14:38,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:14:38,271 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2025-03-17 05:14:38,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-17 05:14:38,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:14:38,275 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:14:38,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:14:38,276 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:14:38,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:14:38,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1047136276, now seen corresponding path program 1 times [2025-03-17 05:14:38,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:14:38,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609021560] [2025-03-17 05:14:38,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:14:38,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:14:38,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 05:14:38,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 05:14:38,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:14:38,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:14:39,988 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:14:39,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:14:39,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609021560] [2025-03-17 05:14:39,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609021560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:14:39,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:14:39,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:14:39,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281080764] [2025-03-17 05:14:39,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:14:39,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:14:39,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:14:39,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:14:39,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:14:39,992 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:14:40,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:14:40,226 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2025-03-17 05:14:40,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:14:40,227 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 54 [2025-03-17 05:14:40,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:14:40,228 INFO L225 Difference]: With dead ends: 56 [2025-03-17 05:14:40,228 INFO L226 Difference]: Without dead ends: 54 [2025-03-17 05:14:40,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:14:40,229 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:14:40,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 149 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:14:40,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-17 05:14:40,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2025-03-17 05:14:40,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 38 states have (on average 1.394736842105263) internal successors, (53), 38 states have internal predecessors, (53), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 05:14:40,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2025-03-17 05:14:40,234 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 54 [2025-03-17 05:14:40,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:14:40,235 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 69 transitions. [2025-03-17 05:14:40,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:14:40,235 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions. [2025-03-17 05:14:40,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-17 05:14:40,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:14:40,236 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:14:40,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:14:40,236 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:14:40,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:14:40,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1515231406, now seen corresponding path program 1 times [2025-03-17 05:14:40,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:14:40,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467053025] [2025-03-17 05:14:40,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:14:40,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:14:40,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 05:14:40,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 05:14:40,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:14:40,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:14:41,004 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:14:41,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:14:41,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467053025] [2025-03-17 05:14:41,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467053025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:14:41,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:14:41,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:14:41,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603265620] [2025-03-17 05:14:41,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:14:41,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:14:41,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:14:41,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:14:41,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:14:41,007 INFO L87 Difference]: Start difference. First operand 48 states and 69 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:14:41,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:14:41,556 INFO L93 Difference]: Finished difference Result 126 states and 173 transitions. [2025-03-17 05:14:41,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 05:14:41,556 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 55 [2025-03-17 05:14:41,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:14:41,557 INFO L225 Difference]: With dead ends: 126 [2025-03-17 05:14:41,557 INFO L226 Difference]: Without dead ends: 79 [2025-03-17 05:14:41,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:14:41,558 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 63 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:14:41,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 210 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:14:41,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-17 05:14:41,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 48. [2025-03-17 05:14:41,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 38 states have (on average 1.368421052631579) internal successors, (52), 38 states have internal predecessors, (52), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 05:14:41,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2025-03-17 05:14:41,565 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 55 [2025-03-17 05:14:41,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:14:41,565 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2025-03-17 05:14:41,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:14:41,566 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2025-03-17 05:14:41,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 05:14:41,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:14:41,566 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:14:41,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:14:41,566 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:14:41,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:14:41,567 INFO L85 PathProgramCache]: Analyzing trace with hash -747038994, now seen corresponding path program 1 times [2025-03-17 05:14:41,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:14:41,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890269626] [2025-03-17 05:14:41,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:14:41,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:14:41,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 05:14:41,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 05:14:41,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:14:41,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:14:41,635 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:14:41,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:14:41,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890269626] [2025-03-17 05:14:41,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890269626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:14:41,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:14:41,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:14:41,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184317395] [2025-03-17 05:14:41,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:14:41,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:14:41,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:14:41,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:14:41,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:14:41,639 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:14:41,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:14:41,669 INFO L93 Difference]: Finished difference Result 108 states and 151 transitions. [2025-03-17 05:14:41,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:14:41,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 56 [2025-03-17 05:14:41,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:14:41,672 INFO L225 Difference]: With dead ends: 108 [2025-03-17 05:14:41,672 INFO L226 Difference]: Without dead ends: 61 [2025-03-17 05:14:41,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:14:41,672 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 9 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:14:41,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 88 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:14:41,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-17 05:14:41,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2025-03-17 05:14:41,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 43 states have internal predecessors, (58), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 05:14:41,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 74 transitions. [2025-03-17 05:14:41,681 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 74 transitions. Word has length 56 [2025-03-17 05:14:41,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:14:41,681 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 74 transitions. [2025-03-17 05:14:41,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:14:41,681 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 74 transitions. [2025-03-17 05:14:41,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 05:14:41,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:14:41,683 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:14:41,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:14:41,683 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:14:41,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:14:41,685 INFO L85 PathProgramCache]: Analyzing trace with hash -718409843, now seen corresponding path program 1 times [2025-03-17 05:14:41,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:14:41,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409481596] [2025-03-17 05:14:41,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:14:41,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:14:41,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 05:14:41,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 05:14:41,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:14:41,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:14:41,730 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:14:41,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:14:41,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409481596] [2025-03-17 05:14:41,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409481596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:14:41,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:14:41,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:14:41,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705032862] [2025-03-17 05:14:41,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:14:41,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:14:41,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:14:41,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:14:41,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:14:41,735 INFO L87 Difference]: Start difference. First operand 53 states and 74 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:14:41,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:14:41,760 INFO L93 Difference]: Finished difference Result 94 states and 131 transitions. [2025-03-17 05:14:41,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:14:41,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 56 [2025-03-17 05:14:41,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:14:41,762 INFO L225 Difference]: With dead ends: 94 [2025-03-17 05:14:41,762 INFO L226 Difference]: Without dead ends: 42 [2025-03-17 05:14:41,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:14:41,762 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:14:41,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:14:41,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-17 05:14:41,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-17 05:14:41,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 05:14:41,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2025-03-17 05:14:41,766 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 57 transitions. Word has length 56 [2025-03-17 05:14:41,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:14:41,766 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 57 transitions. [2025-03-17 05:14:41,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:14:41,766 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2025-03-17 05:14:41,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 05:14:41,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:14:41,767 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:14:41,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:14:41,767 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:14:41,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:14:41,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1912044362, now seen corresponding path program 1 times [2025-03-17 05:14:41,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:14:41,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310334954] [2025-03-17 05:14:41,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:14:41,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:14:41,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 05:14:41,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 05:14:41,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:14:41,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:14:42,615 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:14:42,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:14:42,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310334954] [2025-03-17 05:14:42,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310334954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:14:42,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:14:42,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:14:42,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976192242] [2025-03-17 05:14:42,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:14:42,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:14:42,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:14:42,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:14:42,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:14:42,618 INFO L87 Difference]: Start difference. First operand 42 states and 57 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:14:42,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:14:42,991 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2025-03-17 05:14:42,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 05:14:42,992 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 57 [2025-03-17 05:14:42,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:14:42,993 INFO L225 Difference]: With dead ends: 74 [2025-03-17 05:14:42,994 INFO L226 Difference]: Without dead ends: 72 [2025-03-17 05:14:42,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:14:42,995 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 65 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:14:42,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 159 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:14:42,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-17 05:14:43,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 42. [2025-03-17 05:14:43,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 05:14:43,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2025-03-17 05:14:43,003 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 57 transitions. Word has length 57 [2025-03-17 05:14:43,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:14:43,004 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 57 transitions. [2025-03-17 05:14:43,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 05:14:43,004 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2025-03-17 05:14:43,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 05:14:43,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:14:43,005 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:14:43,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:14:43,005 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:14:43,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:14:43,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1912014571, now seen corresponding path program 1 times [2025-03-17 05:14:43,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:14:43,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601796232] [2025-03-17 05:14:43,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:14:43,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:14:43,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 05:14:43,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 05:14:43,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:14:43,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat