./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem12_label11.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 7c2a5ace26f36583b09a306c2edaa0573f422d931cc3959f8aefc935152706cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:44:26,130 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:44:26,166 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:44:26,169 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:44:26,169 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:44:26,187 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:44:26,188 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:44:26,188 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:44:26,188 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:44:26,188 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:44:26,188 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:44:26,188 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:44:26,189 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:44:26,189 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:44:26,189 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:44:26,189 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:44:26,189 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:44:26,189 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:44:26,189 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:44:26,189 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:44:26,189 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:44:26,189 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:44:26,190 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:44:26,190 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:44:26,190 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:44:26,190 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:44:26,190 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:44:26,190 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:44:26,190 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:44:26,190 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:44:26,190 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:44:26,190 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:44:26,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:44:26,190 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:44:26,191 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:44:26,191 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:44:26,191 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:44:26,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:44:26,191 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:44:26,191 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:44:26,191 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:44:26,191 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:44:26,191 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:44:26,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:44:26,191 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:44:26,191 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:44:26,191 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:44:26,192 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:44:26,192 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-jdk21/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 -> 7c2a5ace26f36583b09a306c2edaa0573f422d931cc3959f8aefc935152706cf [2025-01-08 23:44:26,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:44:26,359 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:44:26,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:44:26,361 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:44:26,361 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:44:26,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label11.c [2025-01-08 23:44:27,652 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3d7fab756/9695226791ee479ebcdfe5887bf06bb9/FLAG5aa177b20 [2025-01-08 23:44:28,106 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:44:28,107 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label11.c [2025-01-08 23:44:28,136 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3d7fab756/9695226791ee479ebcdfe5887bf06bb9/FLAG5aa177b20 [2025-01-08 23:44:28,149 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3d7fab756/9695226791ee479ebcdfe5887bf06bb9 [2025-01-08 23:44:28,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:44:28,152 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:44:28,154 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:44:28,154 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:44:28,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:44:28,158 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:44:28" (1/1) ... [2025-01-08 23:44:28,159 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@652ce60b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:44:28, skipping insertion in model container [2025-01-08 23:44:28,159 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:44:28" (1/1) ... [2025-01-08 23:44:28,231 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:44:28,391 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label11.c[5009,5022] [2025-01-08 23:44:28,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:44:28,876 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:44:28,890 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label11.c[5009,5022] [2025-01-08 23:44:29,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:44:29,162 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:44:29,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:44:29 WrapperNode [2025-01-08 23:44:29,163 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:44:29,164 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:44:29,164 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:44:29,165 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:44:29,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:44:29" (1/1) ... [2025-01-08 23:44:29,208 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:44:29" (1/1) ... [2025-01-08 23:44:29,441 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-01-08 23:44:29,441 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:44:29,442 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:44:29,442 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:44:29,443 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:44:29,449 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:44:29" (1/1) ... [2025-01-08 23:44:29,449 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:44:29" (1/1) ... [2025-01-08 23:44:29,484 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:44:29" (1/1) ... [2025-01-08 23:44:29,681 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-01-08 23:44:29,684 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:44:29" (1/1) ... [2025-01-08 23:44:29,685 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:44:29" (1/1) ... [2025-01-08 23:44:29,798 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:44:29" (1/1) ... [2025-01-08 23:44:29,812 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:44:29" (1/1) ... [2025-01-08 23:44:29,831 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:44:29" (1/1) ... [2025-01-08 23:44:29,853 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:44:29" (1/1) ... [2025-01-08 23:44:29,870 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:44:29" (1/1) ... [2025-01-08 23:44:29,907 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:44:29,909 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:44:29,909 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:44:29,909 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:44:29,910 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:44:29" (1/1) ... [2025-01-08 23:44:29,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:44:29,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:44:29,937 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 23:44:29,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 23:44:29,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:44:29,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:44:29,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:44:29,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:44:30,010 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:44:30,011 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:44:33,152 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-01-08 23:44:33,152 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:44:33,169 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:44:33,169 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:44:33,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:44:33 BoogieIcfgContainer [2025-01-08 23:44:33,170 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:44:33,171 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:44:33,171 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:44:33,174 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:44:33,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:44:28" (1/3) ... [2025-01-08 23:44:33,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ccfeaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:44:33, skipping insertion in model container [2025-01-08 23:44:33,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:44:29" (2/3) ... [2025-01-08 23:44:33,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ccfeaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:44:33, skipping insertion in model container [2025-01-08 23:44:33,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:44:33" (3/3) ... [2025-01-08 23:44:33,176 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label11.c [2025-01-08 23:44:33,185 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:44:33,186 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label11.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:44:33,232 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:44:33,239 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;@5d6c55c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:44:33,239 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:44:33,243 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:33,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-08 23:44:33,247 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:44:33,247 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:44:33,247 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:44:33,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:44:33,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1896988172, now seen corresponding path program 1 times [2025-01-08 23:44:33,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:44:33,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301814137] [2025-01-08 23:44:33,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:44:33,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:44:33,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-08 23:44:33,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-08 23:44:33,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:44:33,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:44:33,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:44:33,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:44:33,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301814137] [2025-01-08 23:44:33,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301814137] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:44:33,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:44:33,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:44:33,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362061877] [2025-01-08 23:44:33,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:44:33,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:44:33,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:44:33,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:44:33,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:44:33,489 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:36,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:44:36,435 INFO L93 Difference]: Finished difference Result 2388 states and 4626 transitions. [2025-01-08 23:44:36,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:44:36,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-01-08 23:44:36,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:44:36,453 INFO L225 Difference]: With dead ends: 2388 [2025-01-08 23:44:36,453 INFO L226 Difference]: Without dead ends: 1506 [2025-01-08 23:44:36,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-08 23:44:36,461 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 797 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2500 mSolverCounterSat, 764 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 3264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 764 IncrementalHoareTripleChecker+Valid, 2500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:44:36,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 112 Invalid, 3264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [764 Valid, 2500 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-08 23:44:36,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-01-08 23:44:36,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2025-01-08 23:44:36,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1505 states have (on average 1.86578073089701) internal successors, (2808), 1505 states have internal predecessors, (2808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:36,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2808 transitions. [2025-01-08 23:44:36,548 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2808 transitions. Word has length 39 [2025-01-08 23:44:36,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:44:36,548 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 2808 transitions. [2025-01-08 23:44:36,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:36,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2808 transitions. [2025-01-08 23:44:36,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-08 23:44:36,551 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:44:36,551 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 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-01-08 23:44:36,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:44:36,551 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:44:36,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:44:36,552 INFO L85 PathProgramCache]: Analyzing trace with hash -2022876012, now seen corresponding path program 1 times [2025-01-08 23:44:36,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:44:36,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118938899] [2025-01-08 23:44:36,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:44:36,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:44:36,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-08 23:44:36,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-08 23:44:36,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:44:36,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:44:36,875 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:44:36,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:44:36,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118938899] [2025-01-08 23:44:36,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118938899] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:44:36,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:44:36,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:44:36,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599880851] [2025-01-08 23:44:36,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:44:36,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:44:36,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:44:36,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:44:36,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:44:36,879 INFO L87 Difference]: Start difference. First operand 1506 states and 2808 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:41,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:44:41,017 INFO L93 Difference]: Finished difference Result 5271 states and 9796 transitions. [2025-01-08 23:44:41,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 23:44:41,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-01-08 23:44:41,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:44:41,029 INFO L225 Difference]: With dead ends: 5271 [2025-01-08 23:44:41,029 INFO L226 Difference]: Without dead ends: 3767 [2025-01-08 23:44:41,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-01-08 23:44:41,032 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 2310 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3612 mSolverCounterSat, 1529 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2310 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 5141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1529 IncrementalHoareTripleChecker+Valid, 3612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:44:41,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2310 Valid, 199 Invalid, 5141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1529 Valid, 3612 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-01-08 23:44:41,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3767 states. [2025-01-08 23:44:41,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3767 to 3759. [2025-01-08 23:44:41,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3759 states, 3758 states have (on average 1.6053751995742416) internal successors, (6033), 3758 states have internal predecessors, (6033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:41,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3759 states to 3759 states and 6033 transitions. [2025-01-08 23:44:41,087 INFO L78 Accepts]: Start accepts. Automaton has 3759 states and 6033 transitions. Word has length 104 [2025-01-08 23:44:41,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:44:41,088 INFO L471 AbstractCegarLoop]: Abstraction has 3759 states and 6033 transitions. [2025-01-08 23:44:41,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:41,088 INFO L276 IsEmpty]: Start isEmpty. Operand 3759 states and 6033 transitions. [2025-01-08 23:44:41,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-01-08 23:44:41,094 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:44:41,094 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:44:41,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:44:41,094 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:44:41,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:44:41,095 INFO L85 PathProgramCache]: Analyzing trace with hash -2005788601, now seen corresponding path program 1 times [2025-01-08 23:44:41,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:44:41,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403157429] [2025-01-08 23:44:41,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:44:41,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:44:41,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-01-08 23:44:41,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-01-08 23:44:41,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:44:41,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:44:41,496 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-08 23:44:41,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:44:41,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403157429] [2025-01-08 23:44:41,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403157429] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:44:41,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:44:41,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:44:41,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990738063] [2025-01-08 23:44:41,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:44:41,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:44:41,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:44:41,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:44:41,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:44:41,499 INFO L87 Difference]: Start difference. First operand 3759 states and 6033 transitions. Second operand has 4 states, 4 states have (on average 49.5) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:44,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:44:44,733 INFO L93 Difference]: Finished difference Result 10559 states and 17375 transitions. [2025-01-08 23:44:44,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:44:44,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 49.5) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 200 [2025-01-08 23:44:44,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:44:44,755 INFO L225 Difference]: With dead ends: 10559 [2025-01-08 23:44:44,755 INFO L226 Difference]: Without dead ends: 6765 [2025-01-08 23:44:44,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:44:44,760 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 704 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 3109 mSolverCounterSat, 728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 3837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 728 IncrementalHoareTripleChecker+Valid, 3109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:44:44,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 710 Invalid, 3837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [728 Valid, 3109 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-08 23:44:44,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6765 states. [2025-01-08 23:44:44,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6765 to 6763. [2025-01-08 23:44:44,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6763 states, 6762 states have (on average 1.3571428571428572) internal successors, (9177), 6762 states have internal predecessors, (9177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:44,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6763 states to 6763 states and 9177 transitions. [2025-01-08 23:44:44,847 INFO L78 Accepts]: Start accepts. Automaton has 6763 states and 9177 transitions. Word has length 200 [2025-01-08 23:44:44,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:44:44,847 INFO L471 AbstractCegarLoop]: Abstraction has 6763 states and 9177 transitions. [2025-01-08 23:44:44,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.5) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:44,847 INFO L276 IsEmpty]: Start isEmpty. Operand 6763 states and 9177 transitions. [2025-01-08 23:44:44,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-01-08 23:44:44,850 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:44:44,851 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:44:44,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:44:44,851 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:44:44,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:44:44,853 INFO L85 PathProgramCache]: Analyzing trace with hash -214041354, now seen corresponding path program 1 times [2025-01-08 23:44:44,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:44:44,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778010946] [2025-01-08 23:44:44,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:44:44,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:44:44,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-08 23:44:44,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-08 23:44:44,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:44:44,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:44:45,056 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-01-08 23:44:45,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:44:45,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778010946] [2025-01-08 23:44:45,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778010946] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:44:45,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:44:45,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:44:45,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919684600] [2025-01-08 23:44:45,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:44:45,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:44:45,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:44:45,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:44:45,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:44:45,058 INFO L87 Difference]: Start difference. First operand 6763 states and 9177 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:47,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:44:47,306 INFO L93 Difference]: Finished difference Result 16530 states and 23478 transitions. [2025-01-08 23:44:47,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:44:47,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 270 [2025-01-08 23:44:47,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:44:47,332 INFO L225 Difference]: With dead ends: 16530 [2025-01-08 23:44:47,333 INFO L226 Difference]: Without dead ends: 9769 [2025-01-08 23:44:47,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-08 23:44:47,351 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 848 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2343 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 2809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 2343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:44:47,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 390 Invalid, 2809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 2343 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-08 23:44:47,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9769 states. [2025-01-08 23:44:47,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9769 to 9767. [2025-01-08 23:44:47,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9767 states, 9766 states have (on average 1.3653491705918492) internal successors, (13334), 9766 states have internal predecessors, (13334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:47,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9767 states to 9767 states and 13334 transitions. [2025-01-08 23:44:47,480 INFO L78 Accepts]: Start accepts. Automaton has 9767 states and 13334 transitions. Word has length 270 [2025-01-08 23:44:47,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:44:47,481 INFO L471 AbstractCegarLoop]: Abstraction has 9767 states and 13334 transitions. [2025-01-08 23:44:47,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:47,481 INFO L276 IsEmpty]: Start isEmpty. Operand 9767 states and 13334 transitions. [2025-01-08 23:44:47,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-01-08 23:44:47,521 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:44:47,522 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:44:47,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:44:47,523 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:44:47,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:44:47,523 INFO L85 PathProgramCache]: Analyzing trace with hash -370142394, now seen corresponding path program 1 times [2025-01-08 23:44:47,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:44:47,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583680233] [2025-01-08 23:44:47,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:44:47,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:44:47,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-01-08 23:44:47,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-01-08 23:44:47,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:44:47,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:44:47,742 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2025-01-08 23:44:47,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:44:47,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583680233] [2025-01-08 23:44:47,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583680233] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:44:47,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:44:47,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:44:47,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60230996] [2025-01-08 23:44:47,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:44:47,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:44:47,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:44:47,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:44:47,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:44:47,744 INFO L87 Difference]: Start difference. First operand 9767 states and 13334 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:50,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:44:50,085 INFO L93 Difference]: Finished difference Result 27042 states and 37585 transitions. [2025-01-08 23:44:50,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:44:50,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 302 [2025-01-08 23:44:50,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:44:50,122 INFO L225 Difference]: With dead ends: 27042 [2025-01-08 23:44:50,122 INFO L226 Difference]: Without dead ends: 17277 [2025-01-08 23:44:50,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-08 23:44:50,132 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 697 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1973 mSolverCounterSat, 860 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 2833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 860 IncrementalHoareTripleChecker+Valid, 1973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:44:50,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 427 Invalid, 2833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [860 Valid, 1973 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-08 23:44:50,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17277 states. [2025-01-08 23:44:50,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17277 to 15775. [2025-01-08 23:44:50,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15775 states, 15774 states have (on average 1.2816026372511728) internal successors, (20216), 15774 states have internal predecessors, (20216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:50,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15775 states to 15775 states and 20216 transitions. [2025-01-08 23:44:50,332 INFO L78 Accepts]: Start accepts. Automaton has 15775 states and 20216 transitions. Word has length 302 [2025-01-08 23:44:50,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:44:50,333 INFO L471 AbstractCegarLoop]: Abstraction has 15775 states and 20216 transitions. [2025-01-08 23:44:50,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:50,333 INFO L276 IsEmpty]: Start isEmpty. Operand 15775 states and 20216 transitions. [2025-01-08 23:44:50,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2025-01-08 23:44:50,338 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:44:50,339 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:44:50,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:44:50,339 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:44:50,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:44:50,340 INFO L85 PathProgramCache]: Analyzing trace with hash 233335973, now seen corresponding path program 1 times [2025-01-08 23:44:50,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:44:50,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769210753] [2025-01-08 23:44:50,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:44:50,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:44:50,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-01-08 23:44:50,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-01-08 23:44:50,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:44:50,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:44:50,599 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-01-08 23:44:50,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:44:50,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769210753] [2025-01-08 23:44:50,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769210753] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:44:50,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:44:50,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:44:50,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188017865] [2025-01-08 23:44:50,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:44:50,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:44:50,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:44:50,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:44:50,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:44:50,603 INFO L87 Difference]: Start difference. First operand 15775 states and 20216 transitions. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:52,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:44:52,843 INFO L93 Difference]: Finished difference Result 39058 states and 51349 transitions. [2025-01-08 23:44:52,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:44:52,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 381 [2025-01-08 23:44:52,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:44:52,892 INFO L225 Difference]: With dead ends: 39058 [2025-01-08 23:44:52,893 INFO L226 Difference]: Without dead ends: 23285 [2025-01-08 23:44:52,902 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-01-08 23:44:52,904 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 739 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 909 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 2984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 909 IncrementalHoareTripleChecker+Valid, 2075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:44:52,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 238 Invalid, 2984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [909 Valid, 2075 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-08 23:44:52,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23285 states. [2025-01-08 23:44:53,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23285 to 23285. [2025-01-08 23:44:53,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23285 states, 23284 states have (on average 1.27456622573441) internal successors, (29677), 23284 states have internal predecessors, (29677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:53,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23285 states to 23285 states and 29677 transitions. [2025-01-08 23:44:53,114 INFO L78 Accepts]: Start accepts. Automaton has 23285 states and 29677 transitions. Word has length 381 [2025-01-08 23:44:53,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:44:53,114 INFO L471 AbstractCegarLoop]: Abstraction has 23285 states and 29677 transitions. [2025-01-08 23:44:53,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:53,115 INFO L276 IsEmpty]: Start isEmpty. Operand 23285 states and 29677 transitions. [2025-01-08 23:44:53,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2025-01-08 23:44:53,158 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:44:53,158 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:44:53,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:44:53,158 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:44:53,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:44:53,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1309204883, now seen corresponding path program 1 times [2025-01-08 23:44:53,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:44:53,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249702248] [2025-01-08 23:44:53,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:44:53,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:44:53,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 398 statements into 1 equivalence classes. [2025-01-08 23:44:53,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 398 of 398 statements. [2025-01-08 23:44:53,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:44:53,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:44:53,399 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-01-08 23:44:53,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:44:53,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249702248] [2025-01-08 23:44:53,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249702248] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:44:53,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:44:53,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:44:53,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500815509] [2025-01-08 23:44:53,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:44:53,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:44:53,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:44:53,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:44:53,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:44:53,400 INFO L87 Difference]: Start difference. First operand 23285 states and 29677 transitions. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:56,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:44:56,064 INFO L93 Difference]: Finished difference Result 57082 states and 72828 transitions. [2025-01-08 23:44:56,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:44:56,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 398 [2025-01-08 23:44:56,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:44:56,140 INFO L225 Difference]: With dead ends: 57082 [2025-01-08 23:44:56,143 INFO L226 Difference]: Without dead ends: 33799 [2025-01-08 23:44:56,176 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-01-08 23:44:56,182 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 730 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2286 mSolverCounterSat, 711 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 2997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 711 IncrementalHoareTripleChecker+Valid, 2286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:44:56,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 283 Invalid, 2997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [711 Valid, 2286 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:44:56,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33799 states. [2025-01-08 23:44:56,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33799 to 33048. [2025-01-08 23:44:56,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33048 states, 33047 states have (on average 1.2610827003964051) internal successors, (41675), 33047 states have internal predecessors, (41675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:56,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33048 states to 33048 states and 41675 transitions. [2025-01-08 23:44:56,672 INFO L78 Accepts]: Start accepts. Automaton has 33048 states and 41675 transitions. Word has length 398 [2025-01-08 23:44:56,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:44:56,672 INFO L471 AbstractCegarLoop]: Abstraction has 33048 states and 41675 transitions. [2025-01-08 23:44:56,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:56,673 INFO L276 IsEmpty]: Start isEmpty. Operand 33048 states and 41675 transitions. [2025-01-08 23:44:56,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-01-08 23:44:56,679 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:44:56,679 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:44:56,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:44:56,680 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:44:56,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:44:56,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1204454866, now seen corresponding path program 1 times [2025-01-08 23:44:56,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:44:56,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426375385] [2025-01-08 23:44:56,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:44:56,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:44:56,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-01-08 23:44:56,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-01-08 23:44:56,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:44:56,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:44:57,095 INFO L134 CoverageAnalysis]: Checked inductivity of 573 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-01-08 23:44:57,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:44:57,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426375385] [2025-01-08 23:44:57,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426375385] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:44:57,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:44:57,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:44:57,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725827894] [2025-01-08 23:44:57,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:44:57,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:44:57,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:44:57,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:44:57,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:44:57,103 INFO L87 Difference]: Start difference. First operand 33048 states and 41675 transitions. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:59,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:44:59,586 INFO L93 Difference]: Finished difference Result 90877 states and 116271 transitions. [2025-01-08 23:44:59,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:44:59,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 409 [2025-01-08 23:44:59,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:44:59,649 INFO L225 Difference]: With dead ends: 90877 [2025-01-08 23:44:59,649 INFO L226 Difference]: Without dead ends: 57831 [2025-01-08 23:44:59,668 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-01-08 23:44:59,669 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 698 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2296 mSolverCounterSat, 632 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 2928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 632 IncrementalHoareTripleChecker+Valid, 2296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:44:59,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 564 Invalid, 2928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [632 Valid, 2296 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-08 23:44:59,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57831 states. [2025-01-08 23:45:00,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57831 to 56329. [2025-01-08 23:45:00,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56329 states, 56328 states have (on average 1.2354779150688822) internal successors, (69592), 56328 states have internal predecessors, (69592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:00,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56329 states to 56329 states and 69592 transitions. [2025-01-08 23:45:00,479 INFO L78 Accepts]: Start accepts. Automaton has 56329 states and 69592 transitions. Word has length 409 [2025-01-08 23:45:00,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:45:00,480 INFO L471 AbstractCegarLoop]: Abstraction has 56329 states and 69592 transitions. [2025-01-08 23:45:00,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:00,480 INFO L276 IsEmpty]: Start isEmpty. Operand 56329 states and 69592 transitions. [2025-01-08 23:45:00,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2025-01-08 23:45:00,487 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:45:00,487 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-01-08 23:45:00,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:45:00,487 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:45:00,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:45:00,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1763506246, now seen corresponding path program 1 times [2025-01-08 23:45:00,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:45:00,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603477695] [2025-01-08 23:45:00,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:45:00,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:45:00,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes. [2025-01-08 23:45:00,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements. [2025-01-08 23:45:00,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:45:00,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:45:01,154 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 348 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-01-08 23:45:01,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:45:01,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603477695] [2025-01-08 23:45:01,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603477695] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:45:01,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:45:01,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:45:01,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661922072] [2025-01-08 23:45:01,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:45:01,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:45:01,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:45:01,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:45:01,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:45:01,157 INFO L87 Difference]: Start difference. First operand 56329 states and 69592 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:03,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:45:03,671 INFO L93 Difference]: Finished difference Result 139692 states and 171784 transitions. [2025-01-08 23:45:03,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:45:03,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 423 [2025-01-08 23:45:03,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:45:03,755 INFO L225 Difference]: With dead ends: 139692 [2025-01-08 23:45:03,755 INFO L226 Difference]: Without dead ends: 83365 [2025-01-08 23:45:03,784 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-01-08 23:45:03,787 INFO L435 NwaCegarLoop]: 1301 mSDtfsCounter, 674 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2158 mSolverCounterSat, 540 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 2698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 540 IncrementalHoareTripleChecker+Valid, 2158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:45:03,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 1309 Invalid, 2698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [540 Valid, 2158 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-08 23:45:03,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83365 states. [2025-01-08 23:45:04,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83365 to 79610. [2025-01-08 23:45:04,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79610 states, 79609 states have (on average 1.1983318469017321) internal successors, (95398), 79609 states have internal predecessors, (95398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:04,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79610 states to 79610 states and 95398 transitions. [2025-01-08 23:45:04,781 INFO L78 Accepts]: Start accepts. Automaton has 79610 states and 95398 transitions. Word has length 423 [2025-01-08 23:45:04,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:45:04,783 INFO L471 AbstractCegarLoop]: Abstraction has 79610 states and 95398 transitions. [2025-01-08 23:45:04,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:04,783 INFO L276 IsEmpty]: Start isEmpty. Operand 79610 states and 95398 transitions. [2025-01-08 23:45:04,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-01-08 23:45:04,797 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:45:04,798 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:45:04,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:45:04,798 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:45:04,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:45:04,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1880094084, now seen corresponding path program 1 times [2025-01-08 23:45:04,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:45:04,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124863404] [2025-01-08 23:45:04,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:45:04,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:45:04,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-01-08 23:45:04,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-01-08 23:45:04,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:45:04,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:45:05,298 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 341 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-01-08 23:45:05,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:45:05,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124863404] [2025-01-08 23:45:05,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124863404] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:45:05,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:45:05,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:45:05,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675917830] [2025-01-08 23:45:05,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:45:05,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:45:05,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:45:05,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:45:05,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:45:05,300 INFO L87 Difference]: Start difference. First operand 79610 states and 95398 transitions. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:07,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:45:07,960 INFO L93 Difference]: Finished difference Result 171985 states and 205413 transitions. [2025-01-08 23:45:07,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:45:07,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 435 [2025-01-08 23:45:07,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:45:08,075 INFO L225 Difference]: With dead ends: 171985 [2025-01-08 23:45:08,075 INFO L226 Difference]: Without dead ends: 92377 [2025-01-08 23:45:08,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-01-08 23:45:08,124 INFO L435 NwaCegarLoop]: 903 mSDtfsCounter, 805 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2138 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 2729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:45:08,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 910 Invalid, 2729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2138 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-08 23:45:08,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92377 states. [2025-01-08 23:45:08,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92377 to 88622. [2025-01-08 23:45:08,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88622 states, 88621 states have (on average 1.158066372530213) internal successors, (102629), 88621 states have internal predecessors, (102629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:09,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88622 states to 88622 states and 102629 transitions. [2025-01-08 23:45:09,171 INFO L78 Accepts]: Start accepts. Automaton has 88622 states and 102629 transitions. Word has length 435 [2025-01-08 23:45:09,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:45:09,171 INFO L471 AbstractCegarLoop]: Abstraction has 88622 states and 102629 transitions. [2025-01-08 23:45:09,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:09,171 INFO L276 IsEmpty]: Start isEmpty. Operand 88622 states and 102629 transitions. [2025-01-08 23:45:09,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2025-01-08 23:45:09,177 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:45:09,177 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:45:09,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 23:45:09,177 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:45:09,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:45:09,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1991443757, now seen corresponding path program 1 times [2025-01-08 23:45:09,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:45:09,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544117769] [2025-01-08 23:45:09,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:45:09,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:45:09,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-01-08 23:45:09,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-01-08 23:45:09,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:45:09,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:45:09,731 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2025-01-08 23:45:09,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:45:09,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544117769] [2025-01-08 23:45:09,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544117769] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:45:09,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:45:09,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:45:09,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031786458] [2025-01-08 23:45:09,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:45:09,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:45:09,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:45:09,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:45:09,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:45:09,812 INFO L87 Difference]: Start difference. First operand 88622 states and 102629 transitions. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:13,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:45:13,057 INFO L93 Difference]: Finished difference Result 211037 states and 245768 transitions. [2025-01-08 23:45:13,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:45:13,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 438 [2025-01-08 23:45:13,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:45:13,202 INFO L225 Difference]: With dead ends: 211037 [2025-01-08 23:45:13,202 INFO L226 Difference]: Without dead ends: 122417 [2025-01-08 23:45:13,266 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-01-08 23:45:13,267 INFO L435 NwaCegarLoop]: 1283 mSDtfsCounter, 690 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2331 mSolverCounterSat, 531 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 2862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 531 IncrementalHoareTripleChecker+Valid, 2331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:45:13,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 1291 Invalid, 2862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [531 Valid, 2331 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-08 23:45:13,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122417 states. [2025-01-08 23:45:14,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122417 to 108899. [2025-01-08 23:45:14,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108899 states, 108898 states have (on average 1.1432441367150912) internal successors, (124497), 108898 states have internal predecessors, (124497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:14,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108899 states to 108899 states and 124497 transitions. [2025-01-08 23:45:14,976 INFO L78 Accepts]: Start accepts. Automaton has 108899 states and 124497 transitions. Word has length 438 [2025-01-08 23:45:14,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:45:14,978 INFO L471 AbstractCegarLoop]: Abstraction has 108899 states and 124497 transitions. [2025-01-08 23:45:14,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:14,978 INFO L276 IsEmpty]: Start isEmpty. Operand 108899 states and 124497 transitions. [2025-01-08 23:45:14,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2025-01-08 23:45:14,984 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:45:14,984 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:45:14,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 23:45:14,984 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:45:14,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:45:14,985 INFO L85 PathProgramCache]: Analyzing trace with hash 227797768, now seen corresponding path program 1 times [2025-01-08 23:45:14,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:45:14,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681364371] [2025-01-08 23:45:14,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:45:14,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:45:15,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-01-08 23:45:15,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-01-08 23:45:15,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:45:15,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:45:15,133 INFO L134 CoverageAnalysis]: Checked inductivity of 725 backedges. 590 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-01-08 23:45:15,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:45:15,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681364371] [2025-01-08 23:45:15,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681364371] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:45:15,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:45:15,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:45:15,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410057076] [2025-01-08 23:45:15,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:45:15,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:45:15,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:45:15,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:45:15,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:45:15,134 INFO L87 Difference]: Start difference. First operand 108899 states and 124497 transitions. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:17,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:45:17,338 INFO L93 Difference]: Finished difference Result 220049 states and 251260 transitions. [2025-01-08 23:45:17,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:45:17,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 488 [2025-01-08 23:45:17,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:45:17,589 INFO L225 Difference]: With dead ends: 220049 [2025-01-08 23:45:17,589 INFO L226 Difference]: Without dead ends: 111152 [2025-01-08 23:45:17,627 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-01-08 23:45:17,628 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 794 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2237 mSolverCounterSat, 430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 2667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 2237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:45:17,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 232 Invalid, 2667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 2237 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-08 23:45:17,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111152 states. [2025-01-08 23:45:18,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111152 to 107397. [2025-01-08 23:45:18,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107397 states, 107396 states have (on average 1.1094826622965475) internal successors, (119154), 107396 states have internal predecessors, (119154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:18,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107397 states to 107397 states and 119154 transitions. [2025-01-08 23:45:18,700 INFO L78 Accepts]: Start accepts. Automaton has 107397 states and 119154 transitions. Word has length 488 [2025-01-08 23:45:18,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:45:18,701 INFO L471 AbstractCegarLoop]: Abstraction has 107397 states and 119154 transitions. [2025-01-08 23:45:18,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:18,701 INFO L276 IsEmpty]: Start isEmpty. Operand 107397 states and 119154 transitions. [2025-01-08 23:45:18,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2025-01-08 23:45:18,710 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:45:18,711 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:45:18,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 23:45:18,711 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:45:18,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:45:18,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1669941533, now seen corresponding path program 1 times [2025-01-08 23:45:18,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:45:18,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807656761] [2025-01-08 23:45:18,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:45:18,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:45:18,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes. [2025-01-08 23:45:18,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements. [2025-01-08 23:45:18,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:45:18,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:45:19,115 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 371 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-01-08 23:45:19,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:45:19,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807656761] [2025-01-08 23:45:19,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807656761] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:45:19,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:45:19,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:45:19,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423788201] [2025-01-08 23:45:19,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:45:19,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:45:19,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:45:19,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:45:19,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:45:19,117 INFO L87 Difference]: Start difference. First operand 107397 states and 119154 transitions. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:21,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:45:21,842 INFO L93 Difference]: Finished difference Result 244081 states and 272658 transitions. [2025-01-08 23:45:21,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:45:21,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 501 [2025-01-08 23:45:21,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:45:21,985 INFO L225 Difference]: With dead ends: 244081 [2025-01-08 23:45:21,985 INFO L226 Difference]: Without dead ends: 136686 [2025-01-08 23:45:22,045 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-01-08 23:45:22,045 INFO L435 NwaCegarLoop]: 1276 mSDtfsCounter, 567 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2242 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 2650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 2242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:45:22,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 1284 Invalid, 2650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 2242 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-08 23:45:22,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136686 states. [2025-01-08 23:45:23,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136686 to 130678. [2025-01-08 23:45:23,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130678 states, 130677 states have (on average 1.099030433817734) internal successors, (143618), 130677 states have internal predecessors, (143618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:23,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130678 states to 130678 states and 143618 transitions. [2025-01-08 23:45:23,371 INFO L78 Accepts]: Start accepts. Automaton has 130678 states and 143618 transitions. Word has length 501 [2025-01-08 23:45:23,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:45:23,371 INFO L471 AbstractCegarLoop]: Abstraction has 130678 states and 143618 transitions. [2025-01-08 23:45:23,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:23,371 INFO L276 IsEmpty]: Start isEmpty. Operand 130678 states and 143618 transitions. [2025-01-08 23:45:23,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2025-01-08 23:45:23,377 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:45:23,377 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:45:23,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 23:45:23,377 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:45:23,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:45:23,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1174546994, now seen corresponding path program 1 times [2025-01-08 23:45:23,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:45:23,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490639476] [2025-01-08 23:45:23,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:45:23,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:45:23,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-01-08 23:45:23,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-01-08 23:45:23,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:45:23,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:45:23,772 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2025-01-08 23:45:23,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:45:23,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490639476] [2025-01-08 23:45:23,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490639476] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:45:23,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:45:23,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:45:23,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111641370] [2025-01-08 23:45:23,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:45:23,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:45:23,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:45:23,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:45:23,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:45:23,774 INFO L87 Difference]: Start difference. First operand 130678 states and 143618 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:26,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:45:26,766 INFO L93 Difference]: Finished difference Result 280129 states and 307873 transitions. [2025-01-08 23:45:26,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:45:26,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 519 [2025-01-08 23:45:26,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:45:26,938 INFO L225 Difference]: With dead ends: 280129 [2025-01-08 23:45:26,938 INFO L226 Difference]: Without dead ends: 149453 [2025-01-08 23:45:26,995 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-01-08 23:45:26,995 INFO L435 NwaCegarLoop]: 1109 mSDtfsCounter, 835 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2198 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 2600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 2198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:45:26,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 1117 Invalid, 2600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [402 Valid, 2198 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:45:27,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149453 states. [2025-01-08 23:45:28,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149453 to 147200. [2025-01-08 23:45:28,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147200 states, 147199 states have (on average 1.092154158655969) internal successors, (160764), 147199 states have internal predecessors, (160764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:28,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147200 states to 147200 states and 160764 transitions. [2025-01-08 23:45:28,567 INFO L78 Accepts]: Start accepts. Automaton has 147200 states and 160764 transitions. Word has length 519 [2025-01-08 23:45:28,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:45:28,568 INFO L471 AbstractCegarLoop]: Abstraction has 147200 states and 160764 transitions. [2025-01-08 23:45:28,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:28,568 INFO L276 IsEmpty]: Start isEmpty. Operand 147200 states and 160764 transitions. [2025-01-08 23:45:28,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2025-01-08 23:45:28,579 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:45:28,579 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:45:28,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 23:45:28,580 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:45:28,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:45:28,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1464160820, now seen corresponding path program 1 times [2025-01-08 23:45:28,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:45:28,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471630239] [2025-01-08 23:45:28,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:45:28,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:45:28,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 592 statements into 1 equivalence classes. [2025-01-08 23:45:28,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 592 of 592 statements. [2025-01-08 23:45:28,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:45:28,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:45:29,249 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-01-08 23:45:29,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:45:29,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471630239] [2025-01-08 23:45:29,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471630239] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:45:29,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:45:29,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:45:29,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995447223] [2025-01-08 23:45:29,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:45:29,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:45:29,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:45:29,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:45:29,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:45:29,251 INFO L87 Difference]: Start difference. First operand 147200 states and 160764 transitions. Second operand has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:32,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:45:32,575 INFO L93 Difference]: Finished difference Result 310920 states and 338829 transitions. [2025-01-08 23:45:32,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:45:32,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 592 [2025-01-08 23:45:32,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:45:32,792 INFO L225 Difference]: With dead ends: 310920 [2025-01-08 23:45:32,793 INFO L226 Difference]: Without dead ends: 163722 [2025-01-08 23:45:32,886 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-01-08 23:45:32,887 INFO L435 NwaCegarLoop]: 1218 mSDtfsCounter, 591 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2410 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 1226 SdHoareTripleChecker+Invalid, 2659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 2410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:45:32,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 1226 Invalid, 2659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 2410 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:45:33,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163722 states. [2025-01-08 23:45:34,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163722 to 159967. [2025-01-08 23:45:34,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159967 states, 159966 states have (on average 1.0813172799219835) internal successors, (172974), 159966 states have internal predecessors, (172974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:34,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159967 states to 159967 states and 172974 transitions. [2025-01-08 23:45:34,851 INFO L78 Accepts]: Start accepts. Automaton has 159967 states and 172974 transitions. Word has length 592 [2025-01-08 23:45:34,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:45:34,851 INFO L471 AbstractCegarLoop]: Abstraction has 159967 states and 172974 transitions. [2025-01-08 23:45:34,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:34,852 INFO L276 IsEmpty]: Start isEmpty. Operand 159967 states and 172974 transitions. [2025-01-08 23:45:34,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 630 [2025-01-08 23:45:34,864 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:45:34,865 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:45:34,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-08 23:45:34,865 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:45:34,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:45:34,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1237395418, now seen corresponding path program 1 times [2025-01-08 23:45:34,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:45:34,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099641023] [2025-01-08 23:45:34,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:45:34,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:45:34,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 629 statements into 1 equivalence classes. [2025-01-08 23:45:34,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 629 of 629 statements. [2025-01-08 23:45:34,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:45:34,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:45:35,478 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 812 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-01-08 23:45:35,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:45:35,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099641023] [2025-01-08 23:45:35,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099641023] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:45:35,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:45:35,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:45:35,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438534124] [2025-01-08 23:45:35,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:45:35,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:45:35,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:45:35,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:45:35,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:45:35,481 INFO L87 Difference]: Start difference. First operand 159967 states and 172974 transitions. Second operand has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:38,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:45:38,262 INFO L93 Difference]: Finished difference Result 329695 states and 356162 transitions. [2025-01-08 23:45:38,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:45:38,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 629 [2025-01-08 23:45:38,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:45:38,448 INFO L225 Difference]: With dead ends: 329695 [2025-01-08 23:45:38,449 INFO L226 Difference]: Without dead ends: 169730 [2025-01-08 23:45:38,533 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-01-08 23:45:38,534 INFO L435 NwaCegarLoop]: 1292 mSDtfsCounter, 605 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2156 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 2428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 2156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:45:38,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 1300 Invalid, 2428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 2156 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-08 23:45:38,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169730 states. [2025-01-08 23:45:40,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169730 to 162971. [2025-01-08 23:45:40,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162971 states, 162970 states have (on average 1.0799472295514512) internal successors, (175999), 162970 states have internal predecessors, (175999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:40,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162971 states to 162971 states and 175999 transitions. [2025-01-08 23:45:40,477 INFO L78 Accepts]: Start accepts. Automaton has 162971 states and 175999 transitions. Word has length 629 [2025-01-08 23:45:40,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:45:40,478 INFO L471 AbstractCegarLoop]: Abstraction has 162971 states and 175999 transitions. [2025-01-08 23:45:40,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:40,478 INFO L276 IsEmpty]: Start isEmpty. Operand 162971 states and 175999 transitions. [2025-01-08 23:45:40,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2025-01-08 23:45:40,494 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:45:40,494 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:45:40,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-08 23:45:40,494 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:45:40,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:45:40,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1468370045, now seen corresponding path program 1 times [2025-01-08 23:45:40,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:45:40,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763286132] [2025-01-08 23:45:40,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:45:40,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:45:40,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 648 statements into 1 equivalence classes. [2025-01-08 23:45:40,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 648 of 648 statements. [2025-01-08 23:45:40,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:45:40,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:45:41,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1214 backedges. 1065 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-01-08 23:45:41,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:45:41,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763286132] [2025-01-08 23:45:41,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763286132] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:45:41,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:45:41,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 23:45:41,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212326054] [2025-01-08 23:45:41,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:45:41,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:45:41,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:45:41,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:45:41,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:45:41,328 INFO L87 Difference]: Start difference. First operand 162971 states and 175999 transitions. Second operand has 4 states, 4 states have (on average 125.25) internal successors, (501), 4 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:45,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:45:45,554 INFO L93 Difference]: Finished difference Result 335703 states and 362184 transitions. [2025-01-08 23:45:45,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:45:45,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 125.25) internal successors, (501), 4 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 648 [2025-01-08 23:45:45,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:45:46,003 INFO L225 Difference]: With dead ends: 335703 [2025-01-08 23:45:46,004 INFO L226 Difference]: Without dead ends: 171983 [2025-01-08 23:45:46,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:45:46,072 INFO L435 NwaCegarLoop]: 1294 mSDtfsCounter, 1309 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 5407 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1309 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 5618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 5407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:45:46,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1309 Valid, 1316 Invalid, 5618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 5407 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-01-08 23:45:46,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171983 states. [2025-01-08 23:45:47,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171983 to 171983. [2025-01-08 23:45:47,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171983 states, 171982 states have (on average 1.0751648428323894) internal successors, (184909), 171982 states have internal predecessors, (184909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:47,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171983 states to 171983 states and 184909 transitions. [2025-01-08 23:45:47,969 INFO L78 Accepts]: Start accepts. Automaton has 171983 states and 184909 transitions. Word has length 648 [2025-01-08 23:45:47,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:45:47,970 INFO L471 AbstractCegarLoop]: Abstraction has 171983 states and 184909 transitions. [2025-01-08 23:45:47,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.25) internal successors, (501), 4 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:47,970 INFO L276 IsEmpty]: Start isEmpty. Operand 171983 states and 184909 transitions. [2025-01-08 23:45:47,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 737 [2025-01-08 23:45:47,991 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:45:47,992 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:45:47,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-08 23:45:47,992 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:45:47,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:45:47,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1251627529, now seen corresponding path program 1 times [2025-01-08 23:45:47,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:45:47,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929686906] [2025-01-08 23:45:47,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:45:47,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:45:48,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 736 statements into 1 equivalence classes. [2025-01-08 23:45:48,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 736 of 736 statements. [2025-01-08 23:45:48,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:45:48,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:45:49,000 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 488 proven. 108 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-01-08 23:45:49,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:45:49,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929686906] [2025-01-08 23:45:49,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929686906] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:45:49,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091582587] [2025-01-08 23:45:49,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:45:49,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:45:49,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:45:49,007 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:45:49,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 23:45:49,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 736 statements into 1 equivalence classes. [2025-01-08 23:45:49,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 736 of 736 statements. [2025-01-08 23:45:49,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:45:49,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:45:49,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:45:49,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:45:49,301 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 697 trivial. 0 not checked. [2025-01-08 23:45:49,302 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:45:49,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091582587] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:45:49,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:45:49,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:45:49,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794749144] [2025-01-08 23:45:49,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:45:49,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:45:49,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:45:49,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:45:49,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:45:49,303 INFO L87 Difference]: Start difference. First operand 171983 states and 184909 transitions. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:51,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:45:51,669 INFO L93 Difference]: Finished difference Result 343964 states and 369816 transitions. [2025-01-08 23:45:51,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:45:51,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 736 [2025-01-08 23:45:51,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:45:51,842 INFO L225 Difference]: With dead ends: 343964 [2025-01-08 23:45:51,843 INFO L226 Difference]: Without dead ends: 171983 [2025-01-08 23:45:51,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 739 GetRequests, 735 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:45:51,923 INFO L435 NwaCegarLoop]: 990 mSDtfsCounter, 788 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2312 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 2576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 2312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:45:51,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 998 Invalid, 2576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 2312 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-08 23:45:52,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171983 states. [2025-01-08 23:45:53,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171983 to 168979. [2025-01-08 23:45:53,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168979 states, 168978 states have (on average 1.0658783983713855) internal successors, (180110), 168978 states have internal predecessors, (180110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:53,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168979 states to 168979 states and 180110 transitions. [2025-01-08 23:45:53,777 INFO L78 Accepts]: Start accepts. Automaton has 168979 states and 180110 transitions. Word has length 736 [2025-01-08 23:45:53,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:45:53,778 INFO L471 AbstractCegarLoop]: Abstraction has 168979 states and 180110 transitions. [2025-01-08 23:45:53,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:53,778 INFO L276 IsEmpty]: Start isEmpty. Operand 168979 states and 180110 transitions. [2025-01-08 23:45:53,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 773 [2025-01-08 23:45:53,795 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:45:53,795 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:45:53,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 23:45:53,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-08 23:45:53,997 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:45:53,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:45:53,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1273313443, now seen corresponding path program 1 times [2025-01-08 23:45:53,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:45:53,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833520631] [2025-01-08 23:45:53,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:45:53,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:45:54,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 772 statements into 1 equivalence classes.