./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-52.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-52.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 860048a24abd15d6568a41ffd17ac25bbefe747caeaf9a3976a4e57ac9819130 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:37:52,567 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:37:52,623 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:37:52,628 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:37:52,629 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:37:52,650 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:37:52,651 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:37:52,651 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:37:52,652 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:37:52,652 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:37:52,653 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:37:52,653 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:37:52,653 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:37:52,653 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:37:52,653 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:37:52,654 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:37:52,654 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:37:52,654 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:37:52,654 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:37:52,654 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:37:52,654 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:37:52,654 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:37:52,654 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:37:52,654 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:37:52,654 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:37:52,655 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:37:52,655 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:37:52,655 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:37:52,655 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:37:52,655 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:37:52,655 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:37:52,655 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:37:52,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:37:52,655 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:37:52,655 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:37:52,655 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:37:52,655 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:37:52,655 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:37:52,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:37:52,655 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:37:52,655 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:37:52,655 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:37:52,655 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:37:52,655 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 -> 860048a24abd15d6568a41ffd17ac25bbefe747caeaf9a3976a4e57ac9819130 [2025-03-17 00:37:52,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:37:52,868 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:37:52,871 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:37:52,871 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:37:52,872 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:37:52,873 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-50_file-52.i [2025-03-17 00:37:54,019 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b91954faa/22e0f741785841deb105aebc4ba9c6e5/FLAGc15576fa7 [2025-03-17 00:37:54,283 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:37:54,285 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-52.i [2025-03-17 00:37:54,293 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b91954faa/22e0f741785841deb105aebc4ba9c6e5/FLAGc15576fa7 [2025-03-17 00:37:54,585 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b91954faa/22e0f741785841deb105aebc4ba9c6e5 [2025-03-17 00:37:54,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:37:54,588 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:37:54,589 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:37:54,589 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:37:54,592 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:37:54,593 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:37:54" (1/1) ... [2025-03-17 00:37:54,593 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55bee783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:37:54, skipping insertion in model container [2025-03-17 00:37:54,593 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:37:54" (1/1) ... [2025-03-17 00:37:54,606 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:37:54,714 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-50_file-52.i[915,928] [2025-03-17 00:37:54,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:37:54,799 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:37:54,808 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-50_file-52.i[915,928] [2025-03-17 00:37:54,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:37:54,861 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:37:54,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:37:54 WrapperNode [2025-03-17 00:37:54,862 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:37:54,863 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:37:54,863 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:37:54,863 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:37:54,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:37:54" (1/1) ... [2025-03-17 00:37:54,875 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:37:54" (1/1) ... [2025-03-17 00:37:54,900 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 244 [2025-03-17 00:37:54,900 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:37:54,901 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:37:54,901 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:37:54,901 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:37:54,908 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:37:54" (1/1) ... [2025-03-17 00:37:54,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:37:54" (1/1) ... [2025-03-17 00:37:54,911 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:37:54" (1/1) ... [2025-03-17 00:37:54,923 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 00:37:54,924 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:37:54" (1/1) ... [2025-03-17 00:37:54,924 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:37:54" (1/1) ... [2025-03-17 00:37:54,930 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:37:54" (1/1) ... [2025-03-17 00:37:54,933 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:37:54" (1/1) ... [2025-03-17 00:37:54,937 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:37:54" (1/1) ... [2025-03-17 00:37:54,938 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:37:54" (1/1) ... [2025-03-17 00:37:54,940 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:37:54,941 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:37:54,941 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:37:54,941 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:37:54,942 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:37:54" (1/1) ... [2025-03-17 00:37:54,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:37:54,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:37:54,967 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 00:37:54,969 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 00:37:54,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:37:54,989 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:37:54,989 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:37:54,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:37:54,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:37:54,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:37:55,062 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:37:55,064 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:37:55,341 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-17 00:37:55,341 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:37:55,353 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:37:55,354 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:37:55,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:37:55 BoogieIcfgContainer [2025-03-17 00:37:55,355 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:37:55,357 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:37:55,357 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:37:55,360 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:37:55,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:37:54" (1/3) ... [2025-03-17 00:37:55,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b75540 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:37:55, skipping insertion in model container [2025-03-17 00:37:55,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:37:54" (2/3) ... [2025-03-17 00:37:55,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b75540 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:37:55, skipping insertion in model container [2025-03-17 00:37:55,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:37:55" (3/3) ... [2025-03-17 00:37:55,362 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-52.i [2025-03-17 00:37:55,371 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:37:55,374 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-52.i that has 2 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:37:55,409 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:37:55,419 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;@3bc9351f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:37:55,419 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:37:55,422 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 62 states have (on average 1.4516129032258065) internal successors, (90), 63 states have internal predecessors, (90), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 00:37:55,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-17 00:37:55,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:37:55,431 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:37:55,432 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:37:55,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:37:55,436 INFO L85 PathProgramCache]: Analyzing trace with hash -16347256, now seen corresponding path program 1 times [2025-03-17 00:37:55,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:37:55,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552176574] [2025-03-17 00:37:55,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:37:55,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:37:55,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-17 00:37:55,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-17 00:37:55,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:37:55,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:37:55,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-03-17 00:37:55,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:37:55,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552176574] [2025-03-17 00:37:55,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552176574] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:37:55,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452200728] [2025-03-17 00:37:55,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:37:55,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:37:55,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:37:55,732 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 00:37:55,734 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 00:37:55,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-17 00:37:55,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-17 00:37:55,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:37:55,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:37:55,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:37:55,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:37:55,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-03-17 00:37:55,938 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:37:55,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452200728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:37:55,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:37:55,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 00:37:55,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53091607] [2025-03-17 00:37:55,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:37:55,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:37:55,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:37:55,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:37:55,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:37:55,962 INFO L87 Difference]: Start difference. First operand has 99 states, 62 states have (on average 1.4516129032258065) internal successors, (90), 63 states have internal predecessors, (90), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-17 00:37:55,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:37:55,995 INFO L93 Difference]: Finished difference Result 195 states and 348 transitions. [2025-03-17 00:37:55,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:37:55,999 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 214 [2025-03-17 00:37:55,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:37:56,005 INFO L225 Difference]: With dead ends: 195 [2025-03-17 00:37:56,007 INFO L226 Difference]: Without dead ends: 97 [2025-03-17 00:37:56,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 215 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 00:37:56,014 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:37:56,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:37:56,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-17 00:37:56,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-17 00:37:56,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 61 states have internal predecessors, (86), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 00:37:56,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 154 transitions. [2025-03-17 00:37:56,060 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 154 transitions. Word has length 214 [2025-03-17 00:37:56,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:37:56,060 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 154 transitions. [2025-03-17 00:37:56,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-17 00:37:56,061 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 154 transitions. [2025-03-17 00:37:56,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-17 00:37:56,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:37:56,068 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:37:56,075 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 00:37:56,269 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 00:37:56,269 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:37:56,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:37:56,270 INFO L85 PathProgramCache]: Analyzing trace with hash -927253238, now seen corresponding path program 1 times [2025-03-17 00:37:56,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:37:56,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310293470] [2025-03-17 00:37:56,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:37:56,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:37:56,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-17 00:37:56,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-17 00:37:56,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:37:56,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:37:56,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 00:37:56,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:37:56,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310293470] [2025-03-17 00:37:56,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310293470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:37:56,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:37:56,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:37:56,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116975468] [2025-03-17 00:37:56,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:37:56,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:37:56,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:37:56,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:37:56,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:37:56,800 INFO L87 Difference]: Start difference. First operand 97 states and 154 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 00:37:57,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:37:57,017 INFO L93 Difference]: Finished difference Result 261 states and 414 transitions. [2025-03-17 00:37:57,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:37:57,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 214 [2025-03-17 00:37:57,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:37:57,021 INFO L225 Difference]: With dead ends: 261 [2025-03-17 00:37:57,021 INFO L226 Difference]: Without dead ends: 165 [2025-03-17 00:37:57,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 00:37:57,024 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 102 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 00:37:57,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 609 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 00:37:57,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-17 00:37:57,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2025-03-17 00:37:57,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 109 states have (on average 1.4495412844036697) internal successors, (158), 110 states have internal predecessors, (158), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 00:37:57,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 258 transitions. [2025-03-17 00:37:57,052 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 258 transitions. Word has length 214 [2025-03-17 00:37:57,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:37:57,053 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 258 transitions. [2025-03-17 00:37:57,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 00:37:57,053 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 258 transitions. [2025-03-17 00:37:57,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-17 00:37:57,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:37:57,056 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:37:57,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:37:57,056 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:37:57,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:37:57,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1329657769, now seen corresponding path program 1 times [2025-03-17 00:37:57,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:37:57,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805295809] [2025-03-17 00:37:57,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:37:57,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:37:57,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-17 00:37:57,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-17 00:37:57,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:37:57,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:37:57,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 00:37:57,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:37:57,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805295809] [2025-03-17 00:37:57,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805295809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:37:57,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:37:57,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:37:57,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36881656] [2025-03-17 00:37:57,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:37:57,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:37:57,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:37:57,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:37:57,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:37:57,295 INFO L87 Difference]: Start difference. First operand 162 states and 258 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 00:37:57,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:37:57,349 INFO L93 Difference]: Finished difference Result 450 states and 717 transitions. [2025-03-17 00:37:57,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:37:57,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 214 [2025-03-17 00:37:57,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:37:57,355 INFO L225 Difference]: With dead ends: 450 [2025-03-17 00:37:57,356 INFO L226 Difference]: Without dead ends: 289 [2025-03-17 00:37:57,356 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 00:37:57,357 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 96 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:37:57,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 338 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:37:57,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-03-17 00:37:57,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2025-03-17 00:37:57,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 197 states have (on average 1.4619289340101522) internal successors, (288), 200 states have internal predecessors, (288), 84 states have call successors, (84), 4 states have call predecessors, (84), 4 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 00:37:57,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 456 transitions. [2025-03-17 00:37:57,395 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 456 transitions. Word has length 214 [2025-03-17 00:37:57,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:37:57,396 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 456 transitions. [2025-03-17 00:37:57,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 00:37:57,397 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 456 transitions. [2025-03-17 00:37:57,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-17 00:37:57,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:37:57,400 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:37:57,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 00:37:57,401 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:37:57,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:37:57,401 INFO L85 PathProgramCache]: Analyzing trace with hash 782677789, now seen corresponding path program 1 times [2025-03-17 00:37:57,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:37:57,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914993192] [2025-03-17 00:37:57,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:37:57,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:37:57,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-17 00:37:57,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-17 00:37:57,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:37:57,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:38:02,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 00:38:02,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:38:02,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914993192] [2025-03-17 00:38:02,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914993192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:38:02,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:38:02,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 00:38:02,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871229529] [2025-03-17 00:38:02,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:38:02,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 00:38:02,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:38:02,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 00:38:02,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-03-17 00:38:02,898 INFO L87 Difference]: Start difference. First operand 286 states and 456 transitions. Second operand has 16 states, 15 states have (on average 3.2) internal successors, (48), 16 states have internal predecessors, (48), 4 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) [2025-03-17 00:38:06,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:38:06,104 INFO L93 Difference]: Finished difference Result 724 states and 1124 transitions. [2025-03-17 00:38:06,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 00:38:06,104 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 16 states have internal predecessors, (48), 4 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) Word has length 215 [2025-03-17 00:38:06,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:38:06,110 INFO L225 Difference]: With dead ends: 724 [2025-03-17 00:38:06,111 INFO L226 Difference]: Without dead ends: 722 [2025-03-17 00:38:06,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=272, Invalid=720, Unknown=0, NotChecked=0, Total=992 [2025-03-17 00:38:06,112 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 441 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:38:06,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 1026 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 00:38:06,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2025-03-17 00:38:06,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 522. [2025-03-17 00:38:06,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 397 states have (on average 1.508816120906801) internal successors, (599), 400 states have internal predecessors, (599), 118 states have call successors, (118), 6 states have call predecessors, (118), 6 states have return successors, (118), 115 states have call predecessors, (118), 118 states have call successors, (118) [2025-03-17 00:38:06,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 835 transitions. [2025-03-17 00:38:06,159 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 835 transitions. Word has length 215 [2025-03-17 00:38:06,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:38:06,161 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 835 transitions. [2025-03-17 00:38:06,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 16 states have internal predecessors, (48), 4 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) [2025-03-17 00:38:06,161 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 835 transitions. [2025-03-17 00:38:06,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-17 00:38:06,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:38:06,163 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:38:06,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 00:38:06,163 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:38:06,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:38:06,164 INFO L85 PathProgramCache]: Analyzing trace with hash 586164284, now seen corresponding path program 1 times [2025-03-17 00:38:06,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:38:06,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167406220] [2025-03-17 00:38:06,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:38:06,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:38:06,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-17 00:38:06,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-17 00:38:06,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:38:06,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:38:06,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 00:38:06,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:38:06,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167406220] [2025-03-17 00:38:06,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167406220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:38:06,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:38:06,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:38:06,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790192380] [2025-03-17 00:38:06,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:38:06,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:38:06,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:38:06,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:38:06,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:38:06,315 INFO L87 Difference]: Start difference. First operand 522 states and 835 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 00:38:06,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:38:06,460 INFO L93 Difference]: Finished difference Result 1208 states and 1925 transitions. [2025-03-17 00:38:06,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:38:06,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2025-03-17 00:38:06,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:38:06,468 INFO L225 Difference]: With dead ends: 1208 [2025-03-17 00:38:06,468 INFO L226 Difference]: Without dead ends: 871 [2025-03-17 00:38:06,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:38:06,470 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 168 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:38:06,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 613 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:38:06,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2025-03-17 00:38:06,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 534. [2025-03-17 00:38:06,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 409 states have (on average 1.4938875305623471) internal successors, (611), 412 states have internal predecessors, (611), 118 states have call successors, (118), 6 states have call predecessors, (118), 6 states have return successors, (118), 115 states have call predecessors, (118), 118 states have call successors, (118) [2025-03-17 00:38:06,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 847 transitions. [2025-03-17 00:38:06,514 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 847 transitions. Word has length 215 [2025-03-17 00:38:06,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:38:06,515 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 847 transitions. [2025-03-17 00:38:06,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 00:38:06,517 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 847 transitions. [2025-03-17 00:38:06,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-17 00:38:06,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:38:06,518 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:38:06,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 00:38:06,519 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:38:06,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:38:06,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1407300580, now seen corresponding path program 1 times [2025-03-17 00:38:06,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:38:06,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650358643] [2025-03-17 00:38:06,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:38:06,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:38:06,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-17 00:38:06,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-17 00:38:06,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:38:06,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:38:08,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 00:38:08,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:38:08,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650358643] [2025-03-17 00:38:08,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650358643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:38:08,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:38:08,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 00:38:08,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156652743] [2025-03-17 00:38:08,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:38:08,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 00:38:08,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:38:08,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 00:38:08,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 00:38:08,969 INFO L87 Difference]: Start difference. First operand 534 states and 847 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 00:38:09,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:38:09,468 INFO L93 Difference]: Finished difference Result 1406 states and 2195 transitions. [2025-03-17 00:38:09,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 00:38:09,469 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2025-03-17 00:38:09,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:38:09,475 INFO L225 Difference]: With dead ends: 1406 [2025-03-17 00:38:09,475 INFO L226 Difference]: Without dead ends: 1057 [2025-03-17 00:38:09,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-17 00:38:09,476 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 224 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:38:09,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 936 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:38:09,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2025-03-17 00:38:09,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 901. [2025-03-17 00:38:09,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 659 states have (on average 1.4264036418816388) internal successors, (940), 669 states have internal predecessors, (940), 226 states have call successors, (226), 15 states have call predecessors, (226), 15 states have return successors, (226), 216 states have call predecessors, (226), 226 states have call successors, (226) [2025-03-17 00:38:09,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1392 transitions. [2025-03-17 00:38:09,530 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1392 transitions. Word has length 215 [2025-03-17 00:38:09,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:38:09,531 INFO L471 AbstractCegarLoop]: Abstraction has 901 states and 1392 transitions. [2025-03-17 00:38:09,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 00:38:09,532 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1392 transitions. [2025-03-17 00:38:09,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-17 00:38:09,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:38:09,534 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:38:09,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 00:38:09,534 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:38:09,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:38:09,534 INFO L85 PathProgramCache]: Analyzing trace with hash 489274782, now seen corresponding path program 1 times [2025-03-17 00:38:09,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:38:09,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932743786] [2025-03-17 00:38:09,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:38:09,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:38:09,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-17 00:38:09,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-17 00:38:09,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:38:09,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:38:09,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 00:38:09,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:38:09,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932743786] [2025-03-17 00:38:09,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932743786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:38:09,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:38:09,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:38:09,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579246533] [2025-03-17 00:38:09,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:38:09,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:38:09,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:38:09,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:38:09,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:38:09,616 INFO L87 Difference]: Start difference. First operand 901 states and 1392 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 00:38:09,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:38:09,778 INFO L93 Difference]: Finished difference Result 1186 states and 1843 transitions. [2025-03-17 00:38:09,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:38:09,778 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2025-03-17 00:38:09,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:38:09,784 INFO L225 Difference]: With dead ends: 1186 [2025-03-17 00:38:09,784 INFO L226 Difference]: Without dead ends: 889 [2025-03-17 00:38:09,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:38:09,785 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 135 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:38:09,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 213 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:38:09,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2025-03-17 00:38:09,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 889. [2025-03-17 00:38:09,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 647 states have (on average 1.4034003091190108) internal successors, (908), 657 states have internal predecessors, (908), 226 states have call successors, (226), 15 states have call predecessors, (226), 15 states have return successors, (226), 216 states have call predecessors, (226), 226 states have call successors, (226) [2025-03-17 00:38:09,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1360 transitions. [2025-03-17 00:38:09,844 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1360 transitions. Word has length 215 [2025-03-17 00:38:09,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:38:09,844 INFO L471 AbstractCegarLoop]: Abstraction has 889 states and 1360 transitions. [2025-03-17 00:38:09,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 00:38:09,844 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1360 transitions. [2025-03-17 00:38:09,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-17 00:38:09,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:38:09,847 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:38:09,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 00:38:09,847 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:38:09,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:38:09,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1245748699, now seen corresponding path program 1 times [2025-03-17 00:38:09,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:38:09,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323189563] [2025-03-17 00:38:09,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:38:09,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:38:09,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-17 00:38:09,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-17 00:38:09,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:38:09,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:38:12,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 00:38:12,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:38:12,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323189563] [2025-03-17 00:38:12,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323189563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:38:12,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:38:12,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 00:38:12,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415376144] [2025-03-17 00:38:12,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:38:12,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 00:38:12,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:38:12,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 00:38:12,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-03-17 00:38:12,208 INFO L87 Difference]: Start difference. First operand 889 states and 1360 transitions. Second operand has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 14 states have internal predecessors, (49), 4 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) [2025-03-17 00:38:13,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:38:13,167 INFO L93 Difference]: Finished difference Result 1326 states and 2009 transitions. [2025-03-17 00:38:13,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 00:38:13,169 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 14 states have internal predecessors, (49), 4 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) Word has length 216 [2025-03-17 00:38:13,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:38:13,175 INFO L225 Difference]: With dead ends: 1326 [2025-03-17 00:38:13,175 INFO L226 Difference]: Without dead ends: 1021 [2025-03-17 00:38:13,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2025-03-17 00:38:13,177 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 219 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:38:13,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 994 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 00:38:13,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2025-03-17 00:38:13,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 885. [2025-03-17 00:38:13,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 643 states have (on average 1.3934681181959565) internal successors, (896), 653 states have internal predecessors, (896), 226 states have call successors, (226), 15 states have call predecessors, (226), 15 states have return successors, (226), 216 states have call predecessors, (226), 226 states have call successors, (226) [2025-03-17 00:38:13,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1348 transitions. [2025-03-17 00:38:13,229 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1348 transitions. Word has length 216 [2025-03-17 00:38:13,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:38:13,230 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 1348 transitions. [2025-03-17 00:38:13,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 14 states have internal predecessors, (49), 4 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) [2025-03-17 00:38:13,230 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1348 transitions. [2025-03-17 00:38:13,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-17 00:38:13,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:38:13,233 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:38:13,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 00:38:13,233 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:38:13,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:38:13,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1503960216, now seen corresponding path program 1 times [2025-03-17 00:38:13,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:38:13,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918108097] [2025-03-17 00:38:13,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:38:13,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:38:13,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-17 00:38:13,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-17 00:38:13,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:38:13,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:38:15,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 00:38:15,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:38:15,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918108097] [2025-03-17 00:38:15,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918108097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:38:15,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:38:15,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 00:38:15,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473941219] [2025-03-17 00:38:15,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:38:15,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 00:38:15,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:38:15,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 00:38:15,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-17 00:38:15,843 INFO L87 Difference]: Start difference. First operand 885 states and 1348 transitions. Second operand has 15 states, 14 states have (on average 3.5) internal successors, (49), 15 states have internal predecessors, (49), 4 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) [2025-03-17 00:38:17,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:38:17,167 INFO L93 Difference]: Finished difference Result 1699 states and 2562 transitions. [2025-03-17 00:38:17,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 00:38:17,168 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 15 states have internal predecessors, (49), 4 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) Word has length 216 [2025-03-17 00:38:17,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:38:17,173 INFO L225 Difference]: With dead ends: 1699 [2025-03-17 00:38:17,173 INFO L226 Difference]: Without dead ends: 1011 [2025-03-17 00:38:17,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=218, Invalid=594, Unknown=0, NotChecked=0, Total=812 [2025-03-17 00:38:17,176 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 240 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:38:17,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 994 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 00:38:17,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2025-03-17 00:38:17,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 905. [2025-03-17 00:38:17,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 663 states have (on average 1.3815987933634992) internal successors, (916), 673 states have internal predecessors, (916), 226 states have call successors, (226), 15 states have call predecessors, (226), 15 states have return successors, (226), 216 states have call predecessors, (226), 226 states have call successors, (226) [2025-03-17 00:38:17,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1368 transitions. [2025-03-17 00:38:17,226 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1368 transitions. Word has length 216 [2025-03-17 00:38:17,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:38:17,227 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 1368 transitions. [2025-03-17 00:38:17,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 15 states have internal predecessors, (49), 4 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) [2025-03-17 00:38:17,227 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1368 transitions. [2025-03-17 00:38:17,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-17 00:38:17,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:38:17,228 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:38:17,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 00:38:17,229 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:38:17,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:38:17,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1824203018, now seen corresponding path program 1 times [2025-03-17 00:38:17,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:38:17,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679001388] [2025-03-17 00:38:17,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:38:17,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:38:17,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-17 00:38:17,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-17 00:38:17,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:38:17,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:38:18,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 00:38:18,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:38:18,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679001388] [2025-03-17 00:38:18,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679001388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:38:18,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:38:18,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 00:38:18,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540408769] [2025-03-17 00:38:18,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:38:18,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 00:38:18,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:38:18,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 00:38:18,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 00:38:18,801 INFO L87 Difference]: Start difference. First operand 905 states and 1368 transitions. Second operand has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 3 states have call successors, (34) [2025-03-17 00:38:19,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:38:19,282 INFO L93 Difference]: Finished difference Result 1581 states and 2401 transitions. [2025-03-17 00:38:19,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 00:38:19,282 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 3 states have call successors, (34) Word has length 216 [2025-03-17 00:38:19,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:38:19,287 INFO L225 Difference]: With dead ends: 1581 [2025-03-17 00:38:19,287 INFO L226 Difference]: Without dead ends: 913 [2025-03-17 00:38:19,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-17 00:38:19,289 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 217 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:38:19,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 795 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:38:19,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2025-03-17 00:38:19,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 905. [2025-03-17 00:38:19,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 663 states have (on average 1.3755656108597285) internal successors, (912), 673 states have internal predecessors, (912), 226 states have call successors, (226), 15 states have call predecessors, (226), 15 states have return successors, (226), 216 states have call predecessors, (226), 226 states have call successors, (226) [2025-03-17 00:38:19,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1364 transitions. [2025-03-17 00:38:19,340 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1364 transitions. Word has length 216 [2025-03-17 00:38:19,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:38:19,340 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 1364 transitions. [2025-03-17 00:38:19,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 3 states have call successors, (34) [2025-03-17 00:38:19,341 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1364 transitions. [2025-03-17 00:38:19,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-03-17 00:38:19,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:38:19,346 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 00:38:19,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 00:38:19,346 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:38:19,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:38:19,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1328170945, now seen corresponding path program 1 times [2025-03-17 00:38:19,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:38:19,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048788436] [2025-03-17 00:38:19,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:38:19,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:38:19,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-03-17 00:38:19,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-03-17 00:38:19,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:38:19,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:38:25,771 INFO L134 CoverageAnalysis]: Checked inductivity of 9189 backedges. 1 proven. 76 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-17 00:38:25,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:38:25,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048788436] [2025-03-17 00:38:25,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048788436] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:38:25,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214197035] [2025-03-17 00:38:25,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:38:25,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:38:25,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:38:25,774 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:38:25,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 00:38:25,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-03-17 00:38:25,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-03-17 00:38:25,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:38:25,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:38:25,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 927 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-17 00:38:25,959 INFO L279 TraceCheckSpWp]: Computing forward predicates...