./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.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/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.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 c82e02bad63eada28ee405f8cd74dfaf9484d0aadaa27f27fe076fa722fdcdb7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:23:56,069 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:23:56,103 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:23:56,107 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:23:56,107 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:23:56,120 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:23:56,120 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:23:56,120 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:23:56,121 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:23:56,121 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:23:56,121 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:23:56,121 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:23:56,121 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:23:56,121 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:23:56,121 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:23:56,121 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:23:56,122 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:23:56,122 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:23:56,122 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:23:56,122 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:23:56,122 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:23:56,122 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:23:56,122 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:23:56,122 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:23:56,122 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:23:56,122 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:23:56,122 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:23:56,122 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:23:56,122 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:23:56,123 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:23:56,123 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:23:56,123 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:23:56,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:23:56,123 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:23:56,123 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:23:56,123 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:23:56,123 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:23:56,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:23:56,123 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:23:56,123 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:23:56,123 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:23:56,124 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:23:56,124 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:23:56,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:23:56,124 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:23:56,124 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:23:56,124 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:23:56,124 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:23:56,124 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 -> c82e02bad63eada28ee405f8cd74dfaf9484d0aadaa27f27fe076fa722fdcdb7 [2025-01-09 04:23:56,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:23:56,309 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:23:56,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:23:56,315 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:23:56,315 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:23:56,315 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c [2025-01-09 04:23:57,638 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/98adbaa62/7b183428f76f42c9b568484ff65a4a2e/FLAG6a506ed41 [2025-01-09 04:23:57,925 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:23:57,926 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c [2025-01-09 04:23:57,933 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/98adbaa62/7b183428f76f42c9b568484ff65a4a2e/FLAG6a506ed41 [2025-01-09 04:23:57,949 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/98adbaa62/7b183428f76f42c9b568484ff65a4a2e [2025-01-09 04:23:57,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:23:57,951 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:23:57,953 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:23:57,953 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:23:57,956 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:23:57,957 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:23:57" (1/1) ... [2025-01-09 04:23:57,958 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76ba5c5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:57, skipping insertion in model container [2025-01-09 04:23:57,958 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:23:57" (1/1) ... [2025-01-09 04:23:57,983 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:23:58,154 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/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c[16852,16865] [2025-01-09 04:23:58,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:23:58,171 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:23:58,203 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/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c[16852,16865] [2025-01-09 04:23:58,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:23:58,216 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:23:58,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:58 WrapperNode [2025-01-09 04:23:58,217 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:23:58,217 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:23:58,218 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:23:58,218 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:23:58,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:58" (1/1) ... [2025-01-09 04:23:58,228 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:58" (1/1) ... [2025-01-09 04:23:58,247 INFO L138 Inliner]: procedures = 26, calls = 17, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 448 [2025-01-09 04:23:58,248 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:23:58,248 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:23:58,248 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:23:58,248 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:23:58,254 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:58" (1/1) ... [2025-01-09 04:23:58,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:58" (1/1) ... [2025-01-09 04:23:58,256 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:58" (1/1) ... [2025-01-09 04:23:58,266 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-09 04:23:58,267 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:58" (1/1) ... [2025-01-09 04:23:58,267 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:58" (1/1) ... [2025-01-09 04:23:58,272 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:58" (1/1) ... [2025-01-09 04:23:58,273 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:58" (1/1) ... [2025-01-09 04:23:58,276 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:58" (1/1) ... [2025-01-09 04:23:58,277 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:58" (1/1) ... [2025-01-09 04:23:58,278 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:58" (1/1) ... [2025-01-09 04:23:58,280 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:23:58,281 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:23:58,281 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:23:58,281 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:23:58,282 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:58" (1/1) ... [2025-01-09 04:23:58,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:23:58,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:23:58,321 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-09 04:23:58,329 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-09 04:23:58,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:23:58,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:23:58,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:23:58,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:23:58,462 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:23:58,467 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:23:58,882 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2025-01-09 04:23:58,882 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:23:58,891 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:23:58,893 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 04:23:58,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:23:58 BoogieIcfgContainer [2025-01-09 04:23:58,893 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:23:58,894 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:23:58,894 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:23:58,897 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:23:58,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:23:57" (1/3) ... [2025-01-09 04:23:58,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e631750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:23:58, skipping insertion in model container [2025-01-09 04:23:58,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:58" (2/3) ... [2025-01-09 04:23:58,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e631750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:23:58, skipping insertion in model container [2025-01-09 04:23:58,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:23:58" (3/3) ... [2025-01-09 04:23:58,899 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c [2025-01-09 04:23:58,909 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:23:58,910 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c that has 1 procedures, 121 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 04:23:58,955 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:23:58,964 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;@5dd503c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:23:58,964 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:23:58,967 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 119 states have (on average 1.7563025210084033) internal successors, (209), 120 states have internal predecessors, (209), 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-09 04:23:58,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 04:23:58,973 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:58,973 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] [2025-01-09 04:23:58,973 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:58,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:58,978 INFO L85 PathProgramCache]: Analyzing trace with hash 135987505, now seen corresponding path program 1 times [2025-01-09 04:23:58,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:58,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169462673] [2025-01-09 04:23:58,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:58,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:59,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 04:23:59,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 04:23:59,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:59,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:59,400 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-09 04:23:59,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:59,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169462673] [2025-01-09 04:23:59,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169462673] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:59,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:59,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:23:59,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575969617] [2025-01-09 04:23:59,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:59,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:23:59,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:59,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:23:59,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:23:59,423 INFO L87 Difference]: Start difference. First operand has 121 states, 119 states have (on average 1.7563025210084033) internal successors, (209), 120 states have internal predecessors, (209), 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 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-09 04:23:59,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:59,511 INFO L93 Difference]: Finished difference Result 196 states and 332 transitions. [2025-01-09 04:23:59,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:23:59,513 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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 37 [2025-01-09 04:23:59,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:59,522 INFO L225 Difference]: With dead ends: 196 [2025-01-09 04:23:59,522 INFO L226 Difference]: Without dead ends: 118 [2025-01-09 04:23:59,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:23:59,529 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 0 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:23:59,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 762 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:23:59,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-01-09 04:23:59,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-01-09 04:23:59,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.393162393162393) internal successors, (163), 117 states have internal predecessors, (163), 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-09 04:23:59,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 163 transitions. [2025-01-09 04:23:59,553 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 163 transitions. Word has length 37 [2025-01-09 04:23:59,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:59,553 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 163 transitions. [2025-01-09 04:23:59,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-09 04:23:59,554 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 163 transitions. [2025-01-09 04:23:59,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 04:23:59,555 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:59,555 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:23:59,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:23:59,556 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:59,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:59,556 INFO L85 PathProgramCache]: Analyzing trace with hash 493019131, now seen corresponding path program 1 times [2025-01-09 04:23:59,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:59,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509284888] [2025-01-09 04:23:59,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:59,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:59,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 04:23:59,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 04:23:59,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:59,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:59,723 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-09 04:23:59,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:59,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509284888] [2025-01-09 04:23:59,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509284888] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:59,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:59,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:23:59,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237199383] [2025-01-09 04:23:59,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:59,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:23:59,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:59,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:23:59,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:23:59,729 INFO L87 Difference]: Start difference. First operand 118 states and 163 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-09 04:23:59,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:59,765 INFO L93 Difference]: Finished difference Result 252 states and 381 transitions. [2025-01-09 04:23:59,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:23:59,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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 77 [2025-01-09 04:23:59,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:59,768 INFO L225 Difference]: With dead ends: 252 [2025-01-09 04:23:59,768 INFO L226 Difference]: Without dead ends: 181 [2025-01-09 04:23:59,769 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-09 04:23:59,769 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 96 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:23:59,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 347 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:23:59,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-01-09 04:23:59,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2025-01-09 04:23:59,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 1.4775280898876404) internal successors, (263), 178 states have internal predecessors, (263), 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-09 04:23:59,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 263 transitions. [2025-01-09 04:23:59,784 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 263 transitions. Word has length 77 [2025-01-09 04:23:59,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:59,784 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 263 transitions. [2025-01-09 04:23:59,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-09 04:23:59,785 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 263 transitions. [2025-01-09 04:23:59,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 04:23:59,787 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:59,787 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:23:59,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:23:59,787 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:59,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:59,791 INFO L85 PathProgramCache]: Analyzing trace with hash -106298308, now seen corresponding path program 1 times [2025-01-09 04:23:59,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:59,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357083219] [2025-01-09 04:23:59,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:59,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:59,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 04:23:59,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 04:23:59,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:59,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:00,105 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-09 04:24:00,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:00,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357083219] [2025-01-09 04:24:00,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357083219] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:00,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:00,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:24:00,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304244169] [2025-01-09 04:24:00,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:00,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:24:00,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:00,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:24:00,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:24:00,108 INFO L87 Difference]: Start difference. First operand 179 states and 263 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-09 04:24:00,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:00,263 INFO L93 Difference]: Finished difference Result 1103 states and 1775 transitions. [2025-01-09 04:24:00,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:24:00,263 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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 77 [2025-01-09 04:24:00,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:00,267 INFO L225 Difference]: With dead ends: 1103 [2025-01-09 04:24:00,267 INFO L226 Difference]: Without dead ends: 971 [2025-01-09 04:24:00,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:24:00,269 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 2136 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2136 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:00,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2136 Valid, 1179 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:24:00,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2025-01-09 04:24:00,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 309. [2025-01-09 04:24:00,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 1.5389610389610389) internal successors, (474), 308 states have internal predecessors, (474), 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-09 04:24:00,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 474 transitions. [2025-01-09 04:24:00,292 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 474 transitions. Word has length 77 [2025-01-09 04:24:00,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:00,292 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 474 transitions. [2025-01-09 04:24:00,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-09 04:24:00,293 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 474 transitions. [2025-01-09 04:24:00,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 04:24:00,293 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:00,294 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:24:00,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:24:00,294 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:00,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:00,294 INFO L85 PathProgramCache]: Analyzing trace with hash 616396559, now seen corresponding path program 1 times [2025-01-09 04:24:00,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:00,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494594424] [2025-01-09 04:24:00,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:00,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:00,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 04:24:00,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 04:24:00,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:00,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:00,567 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-09 04:24:00,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:00,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494594424] [2025-01-09 04:24:00,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494594424] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:00,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:00,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:24:00,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653086562] [2025-01-09 04:24:00,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:00,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:24:00,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:00,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:24:00,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:24:00,570 INFO L87 Difference]: Start difference. First operand 309 states and 474 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-09 04:24:00,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:00,591 INFO L93 Difference]: Finished difference Result 323 states and 491 transitions. [2025-01-09 04:24:00,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:24:00,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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 78 [2025-01-09 04:24:00,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:00,593 INFO L225 Difference]: With dead ends: 323 [2025-01-09 04:24:00,593 INFO L226 Difference]: Without dead ends: 321 [2025-01-09 04:24:00,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:24:00,594 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:00,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 632 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:24:00,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-01-09 04:24:00,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2025-01-09 04:24:00,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 320 states have (on average 1.51875) internal successors, (486), 320 states have internal predecessors, (486), 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-09 04:24:00,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 486 transitions. [2025-01-09 04:24:00,605 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 486 transitions. Word has length 78 [2025-01-09 04:24:00,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:00,605 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 486 transitions. [2025-01-09 04:24:00,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-09 04:24:00,605 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 486 transitions. [2025-01-09 04:24:00,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 04:24:00,606 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:00,606 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:24:00,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:24:00,607 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:00,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:00,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1981002868, now seen corresponding path program 1 times [2025-01-09 04:24:00,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:00,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133662748] [2025-01-09 04:24:00,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:00,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:00,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 04:24:00,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 04:24:00,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:00,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:00,738 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-09 04:24:00,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:00,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133662748] [2025-01-09 04:24:00,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133662748] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:00,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:00,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:24:00,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392930395] [2025-01-09 04:24:00,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:00,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:24:00,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:00,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:24:00,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:24:00,740 INFO L87 Difference]: Start difference. First operand 321 states and 486 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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-09 04:24:00,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:00,775 INFO L93 Difference]: Finished difference Result 839 states and 1314 transitions. [2025-01-09 04:24:00,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:24:00,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 79 [2025-01-09 04:24:00,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:00,777 INFO L225 Difference]: With dead ends: 839 [2025-01-09 04:24:00,777 INFO L226 Difference]: Without dead ends: 565 [2025-01-09 04:24:00,778 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-09 04:24:00,779 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 76 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:00,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 271 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:24:00,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2025-01-09 04:24:00,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 559. [2025-01-09 04:24:00,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.5448028673835126) internal successors, (862), 558 states have internal predecessors, (862), 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-09 04:24:00,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 862 transitions. [2025-01-09 04:24:00,796 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 862 transitions. Word has length 79 [2025-01-09 04:24:00,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:00,796 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 862 transitions. [2025-01-09 04:24:00,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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-09 04:24:00,797 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 862 transitions. [2025-01-09 04:24:00,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 04:24:00,798 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:00,798 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:24:00,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:24:00,798 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:00,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:00,798 INFO L85 PathProgramCache]: Analyzing trace with hash 247436328, now seen corresponding path program 1 times [2025-01-09 04:24:00,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:00,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730741194] [2025-01-09 04:24:00,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:00,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:00,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 04:24:00,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 04:24:00,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:00,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:00,911 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-09 04:24:00,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:00,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730741194] [2025-01-09 04:24:00,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730741194] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:00,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:00,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:24:00,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223330396] [2025-01-09 04:24:00,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:00,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:24:00,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:00,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:24:00,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:24:00,916 INFO L87 Difference]: Start difference. First operand 559 states and 862 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-09 04:24:00,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:00,946 INFO L93 Difference]: Finished difference Result 1519 states and 2380 transitions. [2025-01-09 04:24:00,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:24:00,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 80 [2025-01-09 04:24:00,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:00,951 INFO L225 Difference]: With dead ends: 1519 [2025-01-09 04:24:00,951 INFO L226 Difference]: Without dead ends: 1007 [2025-01-09 04:24:00,953 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-09 04:24:00,955 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 84 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:00,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 319 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:24:00,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2025-01-09 04:24:00,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 1005. [2025-01-09 04:24:00,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 1004 states have (on average 1.549800796812749) internal successors, (1556), 1004 states have internal predecessors, (1556), 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-09 04:24:00,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1556 transitions. [2025-01-09 04:24:01,000 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1556 transitions. Word has length 80 [2025-01-09 04:24:01,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:01,001 INFO L471 AbstractCegarLoop]: Abstraction has 1005 states and 1556 transitions. [2025-01-09 04:24:01,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-09 04:24:01,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1556 transitions. [2025-01-09 04:24:01,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 04:24:01,005 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:01,006 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:24:01,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:24:01,006 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:01,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:01,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1553252600, now seen corresponding path program 1 times [2025-01-09 04:24:01,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:01,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133758259] [2025-01-09 04:24:01,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:01,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:01,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 04:24:01,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 04:24:01,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:01,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:01,081 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-09 04:24:01,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:01,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133758259] [2025-01-09 04:24:01,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133758259] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:01,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:01,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:24:01,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958775917] [2025-01-09 04:24:01,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:01,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:24:01,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:01,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:24:01,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:24:01,083 INFO L87 Difference]: Start difference. First operand 1005 states and 1556 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-09 04:24:01,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:01,124 INFO L93 Difference]: Finished difference Result 2793 states and 4350 transitions. [2025-01-09 04:24:01,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:24:01,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 80 [2025-01-09 04:24:01,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:01,132 INFO L225 Difference]: With dead ends: 2793 [2025-01-09 04:24:01,132 INFO L226 Difference]: Without dead ends: 1835 [2025-01-09 04:24:01,134 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-09 04:24:01,134 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 88 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:01,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 332 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:24:01,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2025-01-09 04:24:01,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1833. [2025-01-09 04:24:01,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1833 states, 1832 states have (on average 1.5414847161572052) internal successors, (2824), 1832 states have internal predecessors, (2824), 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-09 04:24:01,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 2824 transitions. [2025-01-09 04:24:01,207 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 2824 transitions. Word has length 80 [2025-01-09 04:24:01,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:01,208 INFO L471 AbstractCegarLoop]: Abstraction has 1833 states and 2824 transitions. [2025-01-09 04:24:01,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-09 04:24:01,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2824 transitions. [2025-01-09 04:24:01,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 04:24:01,209 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:01,209 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:24:01,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:24:01,210 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:01,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:01,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1384544744, now seen corresponding path program 1 times [2025-01-09 04:24:01,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:01,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534030261] [2025-01-09 04:24:01,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:01,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:01,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 04:24:01,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 04:24:01,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:01,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:01,271 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-09 04:24:01,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:01,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534030261] [2025-01-09 04:24:01,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534030261] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:01,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:01,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:24:01,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710584725] [2025-01-09 04:24:01,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:01,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:24:01,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:01,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:24:01,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:24:01,273 INFO L87 Difference]: Start difference. First operand 1833 states and 2824 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-09 04:24:01,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:01,327 INFO L93 Difference]: Finished difference Result 5149 states and 7930 transitions. [2025-01-09 04:24:01,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:24:01,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 80 [2025-01-09 04:24:01,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:01,338 INFO L225 Difference]: With dead ends: 5149 [2025-01-09 04:24:01,339 INFO L226 Difference]: Without dead ends: 3363 [2025-01-09 04:24:01,341 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-09 04:24:01,342 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 92 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:01,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 345 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:24:01,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3363 states. [2025-01-09 04:24:01,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3363 to 3361. [2025-01-09 04:24:01,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3361 states, 3360 states have (on average 1.5238095238095237) internal successors, (5120), 3360 states have internal predecessors, (5120), 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-09 04:24:01,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3361 states to 3361 states and 5120 transitions. [2025-01-09 04:24:01,415 INFO L78 Accepts]: Start accepts. Automaton has 3361 states and 5120 transitions. Word has length 80 [2025-01-09 04:24:01,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:01,416 INFO L471 AbstractCegarLoop]: Abstraction has 3361 states and 5120 transitions. [2025-01-09 04:24:01,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-09 04:24:01,416 INFO L276 IsEmpty]: Start isEmpty. Operand 3361 states and 5120 transitions. [2025-01-09 04:24:01,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 04:24:01,417 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:01,417 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:24:01,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:24:01,417 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:01,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:01,417 INFO L85 PathProgramCache]: Analyzing trace with hash -622092376, now seen corresponding path program 1 times [2025-01-09 04:24:01,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:01,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290569151] [2025-01-09 04:24:01,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:01,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:01,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 04:24:01,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 04:24:01,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:01,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:01,470 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-09 04:24:01,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:01,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290569151] [2025-01-09 04:24:01,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290569151] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:01,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:01,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:24:01,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673065640] [2025-01-09 04:24:01,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:01,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:24:01,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:01,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:24:01,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:24:01,472 INFO L87 Difference]: Start difference. First operand 3361 states and 5120 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-09 04:24:01,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:01,548 INFO L93 Difference]: Finished difference Result 9477 states and 14370 transitions. [2025-01-09 04:24:01,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:24:01,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 80 [2025-01-09 04:24:01,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:01,565 INFO L225 Difference]: With dead ends: 9477 [2025-01-09 04:24:01,565 INFO L226 Difference]: Without dead ends: 6163 [2025-01-09 04:24:01,569 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-09 04:24:01,569 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 100 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:01,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 361 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:24:01,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6163 states. [2025-01-09 04:24:01,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6163 to 6161. [2025-01-09 04:24:01,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6161 states, 6160 states have (on average 1.4987012987012986) internal successors, (9232), 6160 states have internal predecessors, (9232), 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-09 04:24:01,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6161 states to 6161 states and 9232 transitions. [2025-01-09 04:24:01,747 INFO L78 Accepts]: Start accepts. Automaton has 6161 states and 9232 transitions. Word has length 80 [2025-01-09 04:24:01,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:01,747 INFO L471 AbstractCegarLoop]: Abstraction has 6161 states and 9232 transitions. [2025-01-09 04:24:01,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-09 04:24:01,748 INFO L276 IsEmpty]: Start isEmpty. Operand 6161 states and 9232 transitions. [2025-01-09 04:24:01,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 04:24:01,748 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:01,748 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:24:01,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:24:01,748 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:01,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:01,752 INFO L85 PathProgramCache]: Analyzing trace with hash -84385997, now seen corresponding path program 1 times [2025-01-09 04:24:01,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:01,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484894969] [2025-01-09 04:24:01,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:01,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:01,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 04:24:01,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 04:24:01,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:01,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:01,803 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-09 04:24:01,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:01,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484894969] [2025-01-09 04:24:01,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484894969] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:01,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:01,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:24:01,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510398567] [2025-01-09 04:24:01,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:01,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:24:01,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:01,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:24:01,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:24:01,805 INFO L87 Difference]: Start difference. First operand 6161 states and 9232 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-09 04:24:01,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:01,910 INFO L93 Difference]: Finished difference Result 12248 states and 18454 transitions. [2025-01-09 04:24:01,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:24:01,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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 81 [2025-01-09 04:24:01,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:01,937 INFO L225 Difference]: With dead ends: 12248 [2025-01-09 04:24:01,937 INFO L226 Difference]: Without dead ends: 8917 [2025-01-09 04:24:01,943 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-09 04:24:01,944 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 101 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:01,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 372 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:24:01,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8917 states. [2025-01-09 04:24:02,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8917 to 8915. [2025-01-09 04:24:02,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8915 states, 8914 states have (on average 1.4918106349562485) internal successors, (13298), 8914 states have internal predecessors, (13298), 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-09 04:24:02,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8915 states to 8915 states and 13298 transitions. [2025-01-09 04:24:02,181 INFO L78 Accepts]: Start accepts. Automaton has 8915 states and 13298 transitions. Word has length 81 [2025-01-09 04:24:02,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:02,181 INFO L471 AbstractCegarLoop]: Abstraction has 8915 states and 13298 transitions. [2025-01-09 04:24:02,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-09 04:24:02,182 INFO L276 IsEmpty]: Start isEmpty. Operand 8915 states and 13298 transitions. [2025-01-09 04:24:02,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 04:24:02,189 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:02,190 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:24:02,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:24:02,190 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:02,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:02,190 INFO L85 PathProgramCache]: Analyzing trace with hash -426054341, now seen corresponding path program 1 times [2025-01-09 04:24:02,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:02,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869499091] [2025-01-09 04:24:02,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:02,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:02,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 04:24:02,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 04:24:02,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:02,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:02,369 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 04:24:02,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:02,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869499091] [2025-01-09 04:24:02,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869499091] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:02,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:02,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:24:02,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642477045] [2025-01-09 04:24:02,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:02,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:24:02,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:02,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:24:02,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:24:02,371 INFO L87 Difference]: Start difference. First operand 8915 states and 13298 transitions. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 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-09 04:24:02,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:02,894 INFO L93 Difference]: Finished difference Result 34273 states and 51657 transitions. [2025-01-09 04:24:02,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:24:02,897 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 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 111 [2025-01-09 04:24:02,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:02,972 INFO L225 Difference]: With dead ends: 34273 [2025-01-09 04:24:02,972 INFO L226 Difference]: Without dead ends: 29791 [2025-01-09 04:24:02,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:24:02,989 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 1645 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1645 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:02,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1645 Valid, 1242 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:24:03,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29791 states. [2025-01-09 04:24:03,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29791 to 13299. [2025-01-09 04:24:03,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13299 states, 13298 states have (on average 1.4921040758008723) internal successors, (19842), 13298 states have internal predecessors, (19842), 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-09 04:24:03,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13299 states to 13299 states and 19842 transitions. [2025-01-09 04:24:03,575 INFO L78 Accepts]: Start accepts. Automaton has 13299 states and 19842 transitions. Word has length 111 [2025-01-09 04:24:03,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:03,575 INFO L471 AbstractCegarLoop]: Abstraction has 13299 states and 19842 transitions. [2025-01-09 04:24:03,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 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-09 04:24:03,575 INFO L276 IsEmpty]: Start isEmpty. Operand 13299 states and 19842 transitions. [2025-01-09 04:24:03,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 04:24:03,580 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:03,580 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:24:03,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:24:03,580 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:03,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:03,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1061333892, now seen corresponding path program 1 times [2025-01-09 04:24:03,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:03,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76231801] [2025-01-09 04:24:03,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:03,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:03,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 04:24:03,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 04:24:03,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:03,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:03,739 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 04:24:03,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:03,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76231801] [2025-01-09 04:24:03,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76231801] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:03,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:03,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:24:03,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668037469] [2025-01-09 04:24:03,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:03,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:24:03,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:03,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:24:03,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:24:03,744 INFO L87 Difference]: Start difference. First operand 13299 states and 19842 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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-09 04:24:04,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:04,278 INFO L93 Difference]: Finished difference Result 38657 states and 58201 transitions. [2025-01-09 04:24:04,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:24:04,279 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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 111 [2025-01-09 04:24:04,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:04,328 INFO L225 Difference]: With dead ends: 38657 [2025-01-09 04:24:04,328 INFO L226 Difference]: Without dead ends: 34175 [2025-01-09 04:24:04,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:24:04,336 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 1554 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1554 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:04,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1554 Valid, 1284 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:24:04,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34175 states. [2025-01-09 04:24:04,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34175 to 17683. [2025-01-09 04:24:04,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17683 states, 17682 states have (on average 1.4922520076914376) internal successors, (26386), 17682 states have internal predecessors, (26386), 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-09 04:24:04,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17683 states to 17683 states and 26386 transitions. [2025-01-09 04:24:04,722 INFO L78 Accepts]: Start accepts. Automaton has 17683 states and 26386 transitions. Word has length 111 [2025-01-09 04:24:04,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:04,722 INFO L471 AbstractCegarLoop]: Abstraction has 17683 states and 26386 transitions. [2025-01-09 04:24:04,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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-09 04:24:04,723 INFO L276 IsEmpty]: Start isEmpty. Operand 17683 states and 26386 transitions. [2025-01-09 04:24:04,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 04:24:04,728 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:04,728 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:24:04,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:24:04,728 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:04,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:04,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1432944476, now seen corresponding path program 1 times [2025-01-09 04:24:04,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:04,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203667094] [2025-01-09 04:24:04,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:04,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:04,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 04:24:04,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 04:24:04,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:04,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:04,938 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 04:24:04,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:04,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203667094] [2025-01-09 04:24:04,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203667094] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:04,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:04,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:24:04,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434556570] [2025-01-09 04:24:04,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:04,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:24:04,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:04,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:24:04,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:24:04,939 INFO L87 Difference]: Start difference. First operand 17683 states and 26386 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 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-09 04:24:05,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:05,447 INFO L93 Difference]: Finished difference Result 43041 states and 64745 transitions. [2025-01-09 04:24:05,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:24:05,448 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 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 111 [2025-01-09 04:24:05,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:05,524 INFO L225 Difference]: With dead ends: 43041 [2025-01-09 04:24:05,524 INFO L226 Difference]: Without dead ends: 38559 [2025-01-09 04:24:05,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:24:05,538 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 1370 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1370 SdHoareTripleChecker+Valid, 1367 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:05,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1370 Valid, 1367 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:24:05,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38559 states. [2025-01-09 04:24:06,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38559 to 22067. [2025-01-09 04:24:06,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22067 states, 22066 states have (on average 1.4923411583431523) internal successors, (32930), 22066 states have internal predecessors, (32930), 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-09 04:24:06,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22067 states to 22067 states and 32930 transitions. [2025-01-09 04:24:06,260 INFO L78 Accepts]: Start accepts. Automaton has 22067 states and 32930 transitions. Word has length 111 [2025-01-09 04:24:06,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:06,260 INFO L471 AbstractCegarLoop]: Abstraction has 22067 states and 32930 transitions. [2025-01-09 04:24:06,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 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-09 04:24:06,261 INFO L276 IsEmpty]: Start isEmpty. Operand 22067 states and 32930 transitions. [2025-01-09 04:24:06,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 04:24:06,269 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:06,270 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:24:06,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:24:06,270 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:06,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:06,271 INFO L85 PathProgramCache]: Analyzing trace with hash 75774524, now seen corresponding path program 1 times [2025-01-09 04:24:06,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:06,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143992024] [2025-01-09 04:24:06,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:06,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:06,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 04:24:06,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 04:24:06,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:06,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:06,551 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 04:24:06,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:06,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143992024] [2025-01-09 04:24:06,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143992024] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:06,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:06,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:24:06,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845139839] [2025-01-09 04:24:06,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:06,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:24:06,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:06,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:24:06,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:24:06,553 INFO L87 Difference]: Start difference. First operand 22067 states and 32930 transitions. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 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-09 04:24:07,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:07,264 INFO L93 Difference]: Finished difference Result 47425 states and 71289 transitions. [2025-01-09 04:24:07,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:24:07,265 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 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 111 [2025-01-09 04:24:07,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:07,326 INFO L225 Difference]: With dead ends: 47425 [2025-01-09 04:24:07,326 INFO L226 Difference]: Without dead ends: 42943 [2025-01-09 04:24:07,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:24:07,335 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 1365 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1365 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:07,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1365 Valid, 1446 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:24:07,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42943 states. [2025-01-09 04:24:07,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42943 to 26451. [2025-01-09 04:24:07,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26451 states, 26450 states have (on average 1.4924007561436674) internal successors, (39474), 26450 states have internal predecessors, (39474), 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-09 04:24:07,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26451 states to 26451 states and 39474 transitions. [2025-01-09 04:24:07,910 INFO L78 Accepts]: Start accepts. Automaton has 26451 states and 39474 transitions. Word has length 111 [2025-01-09 04:24:07,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:07,910 INFO L471 AbstractCegarLoop]: Abstraction has 26451 states and 39474 transitions. [2025-01-09 04:24:07,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 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-09 04:24:07,911 INFO L276 IsEmpty]: Start isEmpty. Operand 26451 states and 39474 transitions. [2025-01-09 04:24:07,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 04:24:07,919 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:07,919 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:24:07,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:24:07,920 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:07,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:07,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1418320934, now seen corresponding path program 1 times [2025-01-09 04:24:07,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:07,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679658565] [2025-01-09 04:24:07,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:07,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:07,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 04:24:07,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 04:24:07,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:07,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:08,143 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 04:24:08,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:08,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679658565] [2025-01-09 04:24:08,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679658565] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:08,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:08,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:24:08,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793554258] [2025-01-09 04:24:08,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:08,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:24:08,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:08,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:24:08,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:24:08,146 INFO L87 Difference]: Start difference. First operand 26451 states and 39474 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 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-09 04:24:08,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:08,816 INFO L93 Difference]: Finished difference Result 51809 states and 77833 transitions. [2025-01-09 04:24:08,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:24:08,817 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 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 111 [2025-01-09 04:24:08,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:08,885 INFO L225 Difference]: With dead ends: 51809 [2025-01-09 04:24:08,885 INFO L226 Difference]: Without dead ends: 47327 [2025-01-09 04:24:08,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:24:08,910 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 1471 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1471 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:08,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1471 Valid, 1504 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:24:08,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47327 states. [2025-01-09 04:24:09,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47327 to 30835. [2025-01-09 04:24:09,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30835 states, 30834 states have (on average 1.492443406629046) internal successors, (46018), 30834 states have internal predecessors, (46018), 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-09 04:24:09,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30835 states to 30835 states and 46018 transitions. [2025-01-09 04:24:09,746 INFO L78 Accepts]: Start accepts. Automaton has 30835 states and 46018 transitions. Word has length 111 [2025-01-09 04:24:09,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:09,746 INFO L471 AbstractCegarLoop]: Abstraction has 30835 states and 46018 transitions. [2025-01-09 04:24:09,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 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-09 04:24:09,746 INFO L276 IsEmpty]: Start isEmpty. Operand 30835 states and 46018 transitions. [2025-01-09 04:24:09,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 04:24:09,754 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:09,754 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:24:09,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:24:09,755 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:09,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:09,755 INFO L85 PathProgramCache]: Analyzing trace with hash 21802271, now seen corresponding path program 1 times [2025-01-09 04:24:09,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:09,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349761267] [2025-01-09 04:24:09,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:09,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:09,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 04:24:09,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 04:24:09,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:09,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:09,864 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:09,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:09,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349761267] [2025-01-09 04:24:09,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349761267] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:09,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:09,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:24:09,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965178703] [2025-01-09 04:24:09,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:09,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:24:09,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:09,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:24:09,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:24:09,865 INFO L87 Difference]: Start difference. First operand 30835 states and 46018 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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-09 04:24:10,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:10,365 INFO L93 Difference]: Finished difference Result 61623 states and 91988 transitions. [2025-01-09 04:24:10,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:24:10,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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 112 [2025-01-09 04:24:10,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:10,402 INFO L225 Difference]: With dead ends: 61623 [2025-01-09 04:24:10,403 INFO L226 Difference]: Without dead ends: 30837 [2025-01-09 04:24:10,427 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-09 04:24:10,428 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 79 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:10,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 362 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:24:10,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30837 states. [2025-01-09 04:24:10,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30837 to 30835. [2025-01-09 04:24:10,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30835 states, 30834 states have (on average 1.481546344943893) internal successors, (45682), 30834 states have internal predecessors, (45682), 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-09 04:24:11,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30835 states to 30835 states and 45682 transitions. [2025-01-09 04:24:11,002 INFO L78 Accepts]: Start accepts. Automaton has 30835 states and 45682 transitions. Word has length 112 [2025-01-09 04:24:11,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:11,002 INFO L471 AbstractCegarLoop]: Abstraction has 30835 states and 45682 transitions. [2025-01-09 04:24:11,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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-09 04:24:11,002 INFO L276 IsEmpty]: Start isEmpty. Operand 30835 states and 45682 transitions. [2025-01-09 04:24:11,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 04:24:11,006 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:11,006 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:24:11,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:24:11,007 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:11,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:11,007 INFO L85 PathProgramCache]: Analyzing trace with hash -411337314, now seen corresponding path program 1 times [2025-01-09 04:24:11,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:11,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766317887] [2025-01-09 04:24:11,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:11,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:11,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 04:24:11,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 04:24:11,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:11,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:11,164 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:11,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:11,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766317887] [2025-01-09 04:24:11,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766317887] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:11,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:11,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:24:11,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415669016] [2025-01-09 04:24:11,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:11,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:24:11,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:11,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:24:11,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:24:11,167 INFO L87 Difference]: Start difference. First operand 30835 states and 45682 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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-09 04:24:11,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:11,328 INFO L93 Difference]: Finished difference Result 46231 states and 68500 transitions. [2025-01-09 04:24:11,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:24:11,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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 112 [2025-01-09 04:24:11,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:11,347 INFO L225 Difference]: With dead ends: 46231 [2025-01-09 04:24:11,348 INFO L226 Difference]: Without dead ends: 15445 [2025-01-09 04:24:11,364 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-09 04:24:11,366 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 73 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:11,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 340 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:24:11,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15445 states. [2025-01-09 04:24:11,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15445 to 15443. [2025-01-09 04:24:11,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15443 states, 15442 states have (on average 1.4698873202952984) internal successors, (22698), 15442 states have internal predecessors, (22698), 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-09 04:24:11,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15443 states to 15443 states and 22698 transitions. [2025-01-09 04:24:11,731 INFO L78 Accepts]: Start accepts. Automaton has 15443 states and 22698 transitions. Word has length 112 [2025-01-09 04:24:11,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:11,732 INFO L471 AbstractCegarLoop]: Abstraction has 15443 states and 22698 transitions. [2025-01-09 04:24:11,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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-09 04:24:11,732 INFO L276 IsEmpty]: Start isEmpty. Operand 15443 states and 22698 transitions. [2025-01-09 04:24:11,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 04:24:11,735 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:11,735 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:24:11,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:24:11,735 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:11,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:11,735 INFO L85 PathProgramCache]: Analyzing trace with hash 988167453, now seen corresponding path program 1 times [2025-01-09 04:24:11,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:11,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973102100] [2025-01-09 04:24:11,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:11,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:11,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 04:24:11,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 04:24:11,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:11,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:11,845 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:11,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:11,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973102100] [2025-01-09 04:24:11,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973102100] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:11,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:11,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:24:11,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105427464] [2025-01-09 04:24:11,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:11,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:24:11,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:11,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:24:11,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:24:11,846 INFO L87 Difference]: Start difference. First operand 15443 states and 22698 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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-09 04:24:11,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:11,982 INFO L93 Difference]: Finished difference Result 23143 states and 34024 transitions. [2025-01-09 04:24:11,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:24:11,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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 112 [2025-01-09 04:24:11,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:11,991 INFO L225 Difference]: With dead ends: 23143 [2025-01-09 04:24:11,991 INFO L226 Difference]: Without dead ends: 7749 [2025-01-09 04:24:12,001 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-09 04:24:12,003 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 67 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:12,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 321 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:24:12,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7749 states. [2025-01-09 04:24:12,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7749 to 7747. [2025-01-09 04:24:12,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7747 states, 7746 states have (on average 1.4575264652723987) internal successors, (11290), 7746 states have internal predecessors, (11290), 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-09 04:24:12,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7747 states to 7747 states and 11290 transitions. [2025-01-09 04:24:12,181 INFO L78 Accepts]: Start accepts. Automaton has 7747 states and 11290 transitions. Word has length 112 [2025-01-09 04:24:12,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:12,182 INFO L471 AbstractCegarLoop]: Abstraction has 7747 states and 11290 transitions. [2025-01-09 04:24:12,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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-09 04:24:12,182 INFO L276 IsEmpty]: Start isEmpty. Operand 7747 states and 11290 transitions. [2025-01-09 04:24:12,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 04:24:12,184 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:12,185 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:24:12,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:24:12,186 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:12,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:12,186 INFO L85 PathProgramCache]: Analyzing trace with hash -496856036, now seen corresponding path program 1 times [2025-01-09 04:24:12,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:12,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253175560] [2025-01-09 04:24:12,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:12,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:12,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 04:24:12,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 04:24:12,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:12,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:12,298 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:12,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:12,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253175560] [2025-01-09 04:24:12,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253175560] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:12,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:12,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:24:12,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373593583] [2025-01-09 04:24:12,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:12,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:24:12,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:12,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:24:12,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:24:12,301 INFO L87 Difference]: Start difference. First operand 7747 states and 11290 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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-09 04:24:12,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:12,378 INFO L93 Difference]: Finished difference Result 11599 states and 16912 transitions. [2025-01-09 04:24:12,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:24:12,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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 112 [2025-01-09 04:24:12,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:12,384 INFO L225 Difference]: With dead ends: 11599 [2025-01-09 04:24:12,384 INFO L226 Difference]: Without dead ends: 3901 [2025-01-09 04:24:12,389 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-09 04:24:12,390 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 61 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:12,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 302 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:24:12,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3901 states. [2025-01-09 04:24:12,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3901 to 3899. [2025-01-09 04:24:12,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3899 states, 3898 states have (on average 1.443817342226783) internal successors, (5628), 3898 states have internal predecessors, (5628), 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-09 04:24:12,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3899 states to 3899 states and 5628 transitions. [2025-01-09 04:24:12,512 INFO L78 Accepts]: Start accepts. Automaton has 3899 states and 5628 transitions. Word has length 112 [2025-01-09 04:24:12,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:12,513 INFO L471 AbstractCegarLoop]: Abstraction has 3899 states and 5628 transitions. [2025-01-09 04:24:12,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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-09 04:24:12,513 INFO L276 IsEmpty]: Start isEmpty. Operand 3899 states and 5628 transitions. [2025-01-09 04:24:12,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 04:24:12,514 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:12,514 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:24:12,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:24:12,514 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:12,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:12,515 INFO L85 PathProgramCache]: Analyzing trace with hash -110607717, now seen corresponding path program 1 times [2025-01-09 04:24:12,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:12,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142773072] [2025-01-09 04:24:12,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:12,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:12,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 04:24:12,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 04:24:12,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:12,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:12,831 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:12,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:12,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142773072] [2025-01-09 04:24:12,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142773072] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:24:12,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738901225] [2025-01-09 04:24:12,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:12,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:24:12,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:24:12,839 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-09 04:24:12,840 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-09 04:24:12,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 04:24:12,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 04:24:12,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:12,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:12,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 04:24:12,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:24:13,682 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:13,682 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:24:14,216 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:14,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738901225] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:24:14,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:24:14,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 9] total 22 [2025-01-09 04:24:14,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874391280] [2025-01-09 04:24:14,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:24:14,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 04:24:14,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:14,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 04:24:14,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2025-01-09 04:24:14,219 INFO L87 Difference]: Start difference. First operand 3899 states and 5628 transitions. Second operand has 22 states, 22 states have (on average 14.954545454545455) internal successors, (329), 22 states have internal predecessors, (329), 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-09 04:24:22,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:22,482 INFO L93 Difference]: Finished difference Result 52577 states and 75208 transitions. [2025-01-09 04:24:22,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2025-01-09 04:24:22,483 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 14.954545454545455) internal successors, (329), 22 states have internal predecessors, (329), 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 112 [2025-01-09 04:24:22,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:22,549 INFO L225 Difference]: With dead ends: 52577 [2025-01-09 04:24:22,549 INFO L226 Difference]: Without dead ends: 49915 [2025-01-09 04:24:22,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13701 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=4794, Invalid=28878, Unknown=0, NotChecked=0, Total=33672 [2025-01-09 04:24:22,570 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 6867 mSDsluCounter, 2887 mSDsCounter, 0 mSdLazyCounter, 2709 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6867 SdHoareTripleChecker+Valid, 3112 SdHoareTripleChecker+Invalid, 2788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 2709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:22,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6867 Valid, 3112 Invalid, 2788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 2709 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 04:24:22,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49915 states. [2025-01-09 04:24:23,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49915 to 42075. [2025-01-09 04:24:23,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42075 states, 42074 states have (on average 1.410704948424205) internal successors, (59354), 42074 states have internal predecessors, (59354), 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-09 04:24:23,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42075 states to 42075 states and 59354 transitions. [2025-01-09 04:24:23,685 INFO L78 Accepts]: Start accepts. Automaton has 42075 states and 59354 transitions. Word has length 112 [2025-01-09 04:24:23,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:23,686 INFO L471 AbstractCegarLoop]: Abstraction has 42075 states and 59354 transitions. [2025-01-09 04:24:23,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 14.954545454545455) internal successors, (329), 22 states have internal predecessors, (329), 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-09 04:24:23,686 INFO L276 IsEmpty]: Start isEmpty. Operand 42075 states and 59354 transitions. [2025-01-09 04:24:23,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 04:24:23,688 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:23,688 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:24:23,698 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-09 04:24:23,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:24:23,889 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:23,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:23,889 INFO L85 PathProgramCache]: Analyzing trace with hash 599947227, now seen corresponding path program 1 times [2025-01-09 04:24:23,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:23,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766867146] [2025-01-09 04:24:23,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:23,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:23,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 04:24:23,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 04:24:23,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:23,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:24,044 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:24:24,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:24,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766867146] [2025-01-09 04:24:24,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766867146] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:24,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:24,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:24:24,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638945820] [2025-01-09 04:24:24,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:24,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:24:24,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:24,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:24:24,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:24:24,046 INFO L87 Difference]: Start difference. First operand 42075 states and 59354 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 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-09 04:24:26,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:26,005 INFO L93 Difference]: Finished difference Result 77955 states and 110647 transitions. [2025-01-09 04:24:26,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:24:26,006 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 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 113 [2025-01-09 04:24:26,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:26,118 INFO L225 Difference]: With dead ends: 77955 [2025-01-09 04:24:26,118 INFO L226 Difference]: Without dead ends: 72393 [2025-01-09 04:24:26,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:24:26,369 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 1256 mSDsluCounter, 1737 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1256 SdHoareTripleChecker+Valid, 2030 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:26,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1256 Valid, 2030 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:24:26,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72393 states. [2025-01-09 04:24:27,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72393 to 47661. [2025-01-09 04:24:27,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47661 states, 47660 states have (on average 1.4101133025597985) internal successors, (67206), 47660 states have internal predecessors, (67206), 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-09 04:24:27,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47661 states to 47661 states and 67206 transitions. [2025-01-09 04:24:27,428 INFO L78 Accepts]: Start accepts. Automaton has 47661 states and 67206 transitions. Word has length 113 [2025-01-09 04:24:27,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:27,428 INFO L471 AbstractCegarLoop]: Abstraction has 47661 states and 67206 transitions. [2025-01-09 04:24:27,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 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-09 04:24:27,428 INFO L276 IsEmpty]: Start isEmpty. Operand 47661 states and 67206 transitions. [2025-01-09 04:24:27,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 04:24:27,430 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:27,430 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:24:27,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:24:27,430 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:27,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:27,431 INFO L85 PathProgramCache]: Analyzing trace with hash 152330438, now seen corresponding path program 1 times [2025-01-09 04:24:27,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:27,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000827724] [2025-01-09 04:24:27,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:27,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:27,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 04:24:27,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 04:24:27,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:27,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:27,499 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:27,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:27,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000827724] [2025-01-09 04:24:27,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000827724] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:27,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:27,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:24:27,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579004446] [2025-01-09 04:24:27,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:27,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:24:27,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:27,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:24:27,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:24:27,501 INFO L87 Difference]: Start difference. First operand 47661 states and 67206 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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-09 04:24:27,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:27,913 INFO L93 Difference]: Finished difference Result 68991 states and 96697 transitions. [2025-01-09 04:24:27,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:24:27,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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 114 [2025-01-09 04:24:27,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:27,939 INFO L225 Difference]: With dead ends: 68991 [2025-01-09 04:24:27,939 INFO L226 Difference]: Without dead ends: 21379 [2025-01-09 04:24:27,969 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-09 04:24:27,975 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 43 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:27,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 300 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:24:27,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21379 states. [2025-01-09 04:24:28,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21379 to 17473. [2025-01-09 04:24:28,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17473 states, 17472 states have (on average 1.3861607142857142) internal successors, (24219), 17472 states have internal predecessors, (24219), 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-09 04:24:28,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17473 states to 17473 states and 24219 transitions. [2025-01-09 04:24:28,501 INFO L78 Accepts]: Start accepts. Automaton has 17473 states and 24219 transitions. Word has length 114 [2025-01-09 04:24:28,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:28,501 INFO L471 AbstractCegarLoop]: Abstraction has 17473 states and 24219 transitions. [2025-01-09 04:24:28,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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-09 04:24:28,501 INFO L276 IsEmpty]: Start isEmpty. Operand 17473 states and 24219 transitions. [2025-01-09 04:24:28,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 04:24:28,502 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:28,502 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:24:28,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 04:24:28,503 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:28,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:28,503 INFO L85 PathProgramCache]: Analyzing trace with hash -50586176, now seen corresponding path program 1 times [2025-01-09 04:24:28,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:28,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682917635] [2025-01-09 04:24:28,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:28,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:28,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 04:24:28,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 04:24:28,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:28,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:28,775 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:28,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:28,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682917635] [2025-01-09 04:24:28,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682917635] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:24:28,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511930017] [2025-01-09 04:24:28,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:28,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:24:28,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:24:28,778 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:24:28,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 04:24:28,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 04:24:28,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 04:24:28,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:28,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:28,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 04:24:28,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:24:29,487 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:29,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:24:30,484 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:30,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511930017] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:24:30,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:24:30,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-01-09 04:24:30,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540177897] [2025-01-09 04:24:30,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:24:30,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 04:24:30,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:30,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 04:24:30,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:24:30,487 INFO L87 Difference]: Start difference. First operand 17473 states and 24219 transitions. Second operand has 25 states, 25 states have (on average 13.0) internal successors, (325), 24 states have internal predecessors, (325), 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-09 04:24:34,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:34,644 INFO L93 Difference]: Finished difference Result 133789 states and 186240 transitions. [2025-01-09 04:24:34,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-01-09 04:24:34,644 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 13.0) internal successors, (325), 24 states have internal predecessors, (325), 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 116 [2025-01-09 04:24:34,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:34,779 INFO L225 Difference]: With dead ends: 133789 [2025-01-09 04:24:34,779 INFO L226 Difference]: Without dead ends: 116695 [2025-01-09 04:24:34,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1301 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=942, Invalid=4170, Unknown=0, NotChecked=0, Total=5112 [2025-01-09 04:24:34,798 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 6094 mSDsluCounter, 1280 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6094 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 1155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:34,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6094 Valid, 1403 Invalid, 1155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:24:34,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116695 states. [2025-01-09 04:24:37,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116695 to 92595. [2025-01-09 04:24:37,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92595 states, 92594 states have (on average 1.3614597058124716) internal successors, (126063), 92594 states have internal predecessors, (126063), 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-09 04:24:37,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92595 states to 92595 states and 126063 transitions. [2025-01-09 04:24:37,358 INFO L78 Accepts]: Start accepts. Automaton has 92595 states and 126063 transitions. Word has length 116 [2025-01-09 04:24:37,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:37,359 INFO L471 AbstractCegarLoop]: Abstraction has 92595 states and 126063 transitions. [2025-01-09 04:24:37,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 13.0) internal successors, (325), 24 states have internal predecessors, (325), 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-09 04:24:37,359 INFO L276 IsEmpty]: Start isEmpty. Operand 92595 states and 126063 transitions. [2025-01-09 04:24:37,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 04:24:37,362 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:37,362 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:24:37,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 04:24:37,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:24:37,563 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:37,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:37,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1967436581, now seen corresponding path program 1 times [2025-01-09 04:24:37,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:37,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023126011] [2025-01-09 04:24:37,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:37,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:37,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 04:24:37,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 04:24:37,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:37,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:37,686 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:37,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:37,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023126011] [2025-01-09 04:24:37,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023126011] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:37,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:37,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:24:37,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185775890] [2025-01-09 04:24:37,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:37,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:24:37,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:37,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:24:37,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:24:37,692 INFO L87 Difference]: Start difference. First operand 92595 states and 126063 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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-09 04:24:38,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:38,840 INFO L93 Difference]: Finished difference Result 142106 states and 193342 transitions. [2025-01-09 04:24:38,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:24:38,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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 116 [2025-01-09 04:24:38,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:38,917 INFO L225 Difference]: With dead ends: 142106 [2025-01-09 04:24:38,918 INFO L226 Difference]: Without dead ends: 52467 [2025-01-09 04:24:38,980 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-09 04:24:38,981 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 36 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:38,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 278 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:24:39,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52467 states. [2025-01-09 04:24:41,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52467 to 52465. [2025-01-09 04:24:41,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52465 states, 52464 states have (on average 1.3412053979871912) internal successors, (70365), 52464 states have internal predecessors, (70365), 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-09 04:24:41,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52465 states to 52465 states and 70365 transitions. [2025-01-09 04:24:41,303 INFO L78 Accepts]: Start accepts. Automaton has 52465 states and 70365 transitions. Word has length 116 [2025-01-09 04:24:41,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:41,304 INFO L471 AbstractCegarLoop]: Abstraction has 52465 states and 70365 transitions. [2025-01-09 04:24:41,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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-09 04:24:41,304 INFO L276 IsEmpty]: Start isEmpty. Operand 52465 states and 70365 transitions. [2025-01-09 04:24:41,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 04:24:41,307 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:41,307 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:24:41,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 04:24:41,307 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:41,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:41,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1012721109, now seen corresponding path program 1 times [2025-01-09 04:24:41,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:41,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194479322] [2025-01-09 04:24:41,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:41,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:41,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 04:24:41,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 04:24:41,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:41,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:41,379 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:41,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:41,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194479322] [2025-01-09 04:24:41,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194479322] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:41,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:41,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:24:41,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106684623] [2025-01-09 04:24:41,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:41,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:24:41,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:41,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:24:41,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:24:41,381 INFO L87 Difference]: Start difference. First operand 52465 states and 70365 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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)