./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.5.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_opt-floodmax.5.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 16e0086acf2f158eb0b3309fc7ab7b15830d1af8d2ef9923a4f4e2311d9d7a3f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:28:51,893 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:28:51,949 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:28:51,955 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:28:51,955 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:28:51,974 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:28:51,975 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:28:51,976 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:28:51,976 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:28:51,976 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:28:51,976 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:28:51,976 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:28:51,977 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:28:51,977 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:28:51,977 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:28:51,978 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:28:51,978 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:28:51,978 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:28:51,978 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:28:51,978 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:28:51,978 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:28:51,979 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:28:51,979 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:28:51,979 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:28:51,979 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:28:51,979 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:28:51,979 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:28:51,979 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:28:51,979 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:28:51,979 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:28:51,980 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:28:51,980 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:28:51,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:28:51,980 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:28:51,980 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:28:51,980 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:28:51,981 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:28:51,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:28:51,981 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:28:51,981 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:28:51,981 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:28:51,981 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:28:51,981 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:28:51,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:28:51,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:28:51,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:28:51,981 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:28:51,981 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:28:51,981 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 -> 16e0086acf2f158eb0b3309fc7ab7b15830d1af8d2ef9923a4f4e2311d9d7a3f [2025-01-09 04:28:52,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:28:52,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:28:52,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:28:52,249 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:28:52,249 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:28:52,250 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.5.ufo.UNBOUNDED.pals.c [2025-01-09 04:28:53,470 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c5d582e8a/ba1e19f2da444b4b96291a7d547f3257/FLAG81564ccc5 [2025-01-09 04:28:53,840 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:28:53,841 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.5.ufo.UNBOUNDED.pals.c [2025-01-09 04:28:53,862 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c5d582e8a/ba1e19f2da444b4b96291a7d547f3257/FLAG81564ccc5 [2025-01-09 04:28:53,878 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c5d582e8a/ba1e19f2da444b4b96291a7d547f3257 [2025-01-09 04:28:53,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:28:53,882 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:28:53,884 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:28:53,884 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:28:53,887 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:28:53,889 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:28:53" (1/1) ... [2025-01-09 04:28:53,890 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@149b4d35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:53, skipping insertion in model container [2025-01-09 04:28:53,890 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:28:53" (1/1) ... [2025-01-09 04:28:53,932 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:28:54,217 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_opt-floodmax.5.ufo.UNBOUNDED.pals.c[65677,65690] [2025-01-09 04:28:54,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:28:54,233 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:28:54,301 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_opt-floodmax.5.ufo.UNBOUNDED.pals.c[65677,65690] [2025-01-09 04:28:54,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:28:54,317 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:28:54,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:54 WrapperNode [2025-01-09 04:28:54,319 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:28:54,320 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:28:54,320 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:28:54,320 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:28:54,325 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:28:54" (1/1) ... [2025-01-09 04:28:54,339 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:28:54" (1/1) ... [2025-01-09 04:28:54,396 INFO L138 Inliner]: procedures = 25, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 2139 [2025-01-09 04:28:54,397 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:28:54,397 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:28:54,397 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:28:54,397 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:28:54,404 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:54" (1/1) ... [2025-01-09 04:28:54,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:54" (1/1) ... [2025-01-09 04:28:54,412 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:54" (1/1) ... [2025-01-09 04:28:54,444 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:28:54,448 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:54" (1/1) ... [2025-01-09 04:28:54,449 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:54" (1/1) ... [2025-01-09 04:28:54,475 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:54" (1/1) ... [2025-01-09 04:28:54,479 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:54" (1/1) ... [2025-01-09 04:28:54,500 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:54" (1/1) ... [2025-01-09 04:28:54,509 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:54" (1/1) ... [2025-01-09 04:28:54,516 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:54" (1/1) ... [2025-01-09 04:28:54,527 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:28:54,528 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:28:54,528 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:28:54,528 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:28:54,529 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:54" (1/1) ... [2025-01-09 04:28:54,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:28:54,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:28:54,558 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:28:54,561 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:28:54,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:28:54,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:28:54,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:28:54,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:28:54,705 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:28:54,706 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:28:56,475 INFO L? ?]: Removed 240 outVars from TransFormulas that were not future-live. [2025-01-09 04:28:56,476 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:28:56,499 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:28:56,499 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 04:28:56,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:28:56 BoogieIcfgContainer [2025-01-09 04:28:56,499 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:28:56,501 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:28:56,501 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:28:56,508 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:28:56,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:28:53" (1/3) ... [2025-01-09 04:28:56,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab2a234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:28:56, skipping insertion in model container [2025-01-09 04:28:56,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:28:54" (2/3) ... [2025-01-09 04:28:56,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab2a234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:28:56, skipping insertion in model container [2025-01-09 04:28:56,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:28:56" (3/3) ... [2025-01-09 04:28:56,510 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.ufo.UNBOUNDED.pals.c [2025-01-09 04:28:56,520 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:28:56,522 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.5.ufo.UNBOUNDED.pals.c that has 1 procedures, 705 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 04:28:56,595 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:28:56,605 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;@46cef3ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:28:56,605 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:28:56,610 INFO L276 IsEmpty]: Start isEmpty. Operand has 705 states, 703 states have (on average 1.864864864864865) internal successors, (1311), 704 states have internal predecessors, (1311), 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:28:56,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 04:28:56,633 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:28:56,634 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:56,635 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:28:56,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:28:56,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1694239024, now seen corresponding path program 1 times [2025-01-09 04:28:56,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:28:56,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692057996] [2025-01-09 04:28:56,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:28:56,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:28:56,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 04:28:56,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 04:28:56,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:28:56,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:28:57,159 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:28:57,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:28:57,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692057996] [2025-01-09 04:28:57,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692057996] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:28:57,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:28:57,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 04:28:57,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601842346] [2025-01-09 04:28:57,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:28:57,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 04:28:57,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:28:57,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 04:28:57,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:28:57,181 INFO L87 Difference]: Start difference. First operand has 705 states, 703 states have (on average 1.864864864864865) internal successors, (1311), 704 states have internal predecessors, (1311), 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 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 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:28:57,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:28:57,240 INFO L93 Difference]: Finished difference Result 857 states and 1584 transitions. [2025-01-09 04:28:57,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 04:28:57,241 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 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 153 [2025-01-09 04:28:57,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:28:57,256 INFO L225 Difference]: With dead ends: 857 [2025-01-09 04:28:57,257 INFO L226 Difference]: Without dead ends: 702 [2025-01-09 04:28:57,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:28:57,262 INFO L435 NwaCegarLoop]: 1306 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:28:57,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1306 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:28:57,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-01-09 04:28:57,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 702. [2025-01-09 04:28:57,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 701 states have (on average 1.8630527817403708) internal successors, (1306), 701 states have internal predecessors, (1306), 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:28:57,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1306 transitions. [2025-01-09 04:28:57,316 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1306 transitions. Word has length 153 [2025-01-09 04:28:57,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:28:57,317 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 1306 transitions. [2025-01-09 04:28:57,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 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:28:57,318 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1306 transitions. [2025-01-09 04:28:57,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 04:28:57,321 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:28:57,321 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:57,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:28:57,321 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:28:57,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:28:57,322 INFO L85 PathProgramCache]: Analyzing trace with hash 2091255182, now seen corresponding path program 1 times [2025-01-09 04:28:57,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:28:57,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170912154] [2025-01-09 04:28:57,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:28:57,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:28:57,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 04:28:57,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 04:28:57,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:28:57,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:28:57,895 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:28:57,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:28:57,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170912154] [2025-01-09 04:28:57,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170912154] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:28:57,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:28:57,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:28:57,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913914159] [2025-01-09 04:28:57,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:28:57,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:28:57,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:28:57,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:28:57,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:28:57,897 INFO L87 Difference]: Start difference. First operand 702 states and 1306 transitions. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 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:28:58,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:28:58,049 INFO L93 Difference]: Finished difference Result 857 states and 1580 transitions. [2025-01-09 04:28:58,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:28:58,049 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 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 153 [2025-01-09 04:28:58,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:28:58,054 INFO L225 Difference]: With dead ends: 857 [2025-01-09 04:28:58,054 INFO L226 Difference]: Without dead ends: 702 [2025-01-09 04:28:58,055 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:28:58,055 INFO L435 NwaCegarLoop]: 1304 mSDtfsCounter, 0 mSDsluCounter, 3842 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5146 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:28:58,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5146 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:28:58,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-01-09 04:28:58,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 702. [2025-01-09 04:28:58,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 701 states have (on average 1.7703281027104136) internal successors, (1241), 701 states have internal predecessors, (1241), 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:28:58,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1241 transitions. [2025-01-09 04:28:58,088 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1241 transitions. Word has length 153 [2025-01-09 04:28:58,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:28:58,088 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 1241 transitions. [2025-01-09 04:28:58,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 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:28:58,088 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1241 transitions. [2025-01-09 04:28:58,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-01-09 04:28:58,091 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:28:58,092 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:58,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:28:58,092 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:28:58,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:28:58,093 INFO L85 PathProgramCache]: Analyzing trace with hash 292043756, now seen corresponding path program 1 times [2025-01-09 04:28:58,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:28:58,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127607458] [2025-01-09 04:28:58,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:28:58,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:28:58,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-09 04:28:58,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-09 04:28:58,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:28:58,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:28:58,442 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:28:58,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:28:58,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127607458] [2025-01-09 04:28:58,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127607458] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:28:58,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:28:58,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:28:58,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335170180] [2025-01-09 04:28:58,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:28:58,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:28:58,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:28:58,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:28:58,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:28:58,444 INFO L87 Difference]: Start difference. First operand 702 states and 1241 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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:28:58,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:28:58,511 INFO L93 Difference]: Finished difference Result 990 states and 1755 transitions. [2025-01-09 04:28:58,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:28:58,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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 217 [2025-01-09 04:28:58,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:28:58,514 INFO L225 Difference]: With dead ends: 990 [2025-01-09 04:28:58,514 INFO L226 Difference]: Without dead ends: 839 [2025-01-09 04:28:58,518 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:28:58,520 INFO L435 NwaCegarLoop]: 1234 mSDtfsCounter, 235 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 2404 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:28:58,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 2404 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:28:58,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2025-01-09 04:28:58,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 836. [2025-01-09 04:28:58,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 835 states have (on average 1.768862275449102) internal successors, (1477), 835 states have internal predecessors, (1477), 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:28:58,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1477 transitions. [2025-01-09 04:28:58,540 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1477 transitions. Word has length 217 [2025-01-09 04:28:58,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:28:58,541 INFO L471 AbstractCegarLoop]: Abstraction has 836 states and 1477 transitions. [2025-01-09 04:28:58,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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:28:58,541 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1477 transitions. [2025-01-09 04:28:58,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-01-09 04:28:58,543 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:28:58,544 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:58,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:28:58,544 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:28:58,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:28:58,545 INFO L85 PathProgramCache]: Analyzing trace with hash 196873030, now seen corresponding path program 1 times [2025-01-09 04:28:58,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:28:58,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420284379] [2025-01-09 04:28:58,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:28:58,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:28:58,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-01-09 04:28:58,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-01-09 04:28:58,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:28:58,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:28:58,834 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:28:58,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:28:58,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420284379] [2025-01-09 04:28:58,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420284379] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:28:58,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:28:58,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:28:58,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797064543] [2025-01-09 04:28:58,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:28:58,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:28:58,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:28:58,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:28:58,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:28:58,838 INFO L87 Difference]: Start difference. First operand 836 states and 1477 transitions. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 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:28:58,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:28:58,890 INFO L93 Difference]: Finished difference Result 1382 states and 2445 transitions. [2025-01-09 04:28:58,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:28:58,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 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 221 [2025-01-09 04:28:58,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:28:58,895 INFO L225 Difference]: With dead ends: 1382 [2025-01-09 04:28:58,895 INFO L226 Difference]: Without dead ends: 1097 [2025-01-09 04:28:58,896 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:28:58,897 INFO L435 NwaCegarLoop]: 1238 mSDtfsCounter, 235 mSDsluCounter, 1179 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 2417 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:28:58,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 2417 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:28:58,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2025-01-09 04:28:58,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1093. [2025-01-09 04:28:58,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1093 states, 1092 states have (on average 1.7692307692307692) internal successors, (1932), 1092 states have internal predecessors, (1932), 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:28:58,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1932 transitions. [2025-01-09 04:28:58,921 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1932 transitions. Word has length 221 [2025-01-09 04:28:58,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:28:58,921 INFO L471 AbstractCegarLoop]: Abstraction has 1093 states and 1932 transitions. [2025-01-09 04:28:58,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 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:28:58,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1932 transitions. [2025-01-09 04:28:58,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-01-09 04:28:58,925 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:28:58,926 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:58,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:28:58,926 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:28:58,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:28:58,927 INFO L85 PathProgramCache]: Analyzing trace with hash -898882144, now seen corresponding path program 1 times [2025-01-09 04:28:58,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:28:58,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396600273] [2025-01-09 04:28:58,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:28:58,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:28:58,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-01-09 04:28:58,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-01-09 04:28:58,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:28:58,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:28:59,197 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:28:59,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:28:59,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396600273] [2025-01-09 04:28:59,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396600273] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:28:59,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:28:59,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:28:59,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699200723] [2025-01-09 04:28:59,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:28:59,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:28:59,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:28:59,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:28:59,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:28:59,199 INFO L87 Difference]: Start difference. First operand 1093 states and 1932 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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:28:59,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:28:59,254 INFO L93 Difference]: Finished difference Result 2129 states and 3766 transitions. [2025-01-09 04:28:59,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:28:59,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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 225 [2025-01-09 04:28:59,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:28:59,261 INFO L225 Difference]: With dead ends: 2129 [2025-01-09 04:28:59,261 INFO L226 Difference]: Without dead ends: 1587 [2025-01-09 04:28:59,262 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:28:59,264 INFO L435 NwaCegarLoop]: 1238 mSDtfsCounter, 227 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 2418 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:28:59,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 2418 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:28:59,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2025-01-09 04:28:59,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 1581. [2025-01-09 04:28:59,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1581 states, 1580 states have (on average 1.7670886075949368) internal successors, (2792), 1580 states have internal predecessors, (2792), 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:28:59,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 2792 transitions. [2025-01-09 04:28:59,299 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 2792 transitions. Word has length 225 [2025-01-09 04:28:59,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:28:59,300 INFO L471 AbstractCegarLoop]: Abstraction has 1581 states and 2792 transitions. [2025-01-09 04:28:59,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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:28:59,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 2792 transitions. [2025-01-09 04:28:59,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-01-09 04:28:59,302 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:28:59,303 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:59,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:28:59,303 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:28:59,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:28:59,303 INFO L85 PathProgramCache]: Analyzing trace with hash -782300422, now seen corresponding path program 1 times [2025-01-09 04:28:59,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:28:59,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379434812] [2025-01-09 04:28:59,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:28:59,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:28:59,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 04:28:59,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 04:28:59,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:28:59,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:28:59,569 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:28:59,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:28:59,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379434812] [2025-01-09 04:28:59,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379434812] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:28:59,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:28:59,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:28:59,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287605901] [2025-01-09 04:28:59,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:28:59,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:28:59,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:28:59,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:28:59,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:28:59,572 INFO L87 Difference]: Start difference. First operand 1581 states and 2792 transitions. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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:28:59,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:28:59,626 INFO L93 Difference]: Finished difference Result 3545 states and 6258 transitions. [2025-01-09 04:28:59,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:28:59,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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 229 [2025-01-09 04:28:59,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:28:59,635 INFO L225 Difference]: With dead ends: 3545 [2025-01-09 04:28:59,636 INFO L226 Difference]: Without dead ends: 2515 [2025-01-09 04:28:59,638 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:28:59,639 INFO L435 NwaCegarLoop]: 1238 mSDtfsCounter, 219 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 2419 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:28:59,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 2419 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:28:59,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2515 states. [2025-01-09 04:28:59,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2515 to 2505. [2025-01-09 04:28:59,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2505 states, 2504 states have (on average 1.7619808306709266) internal successors, (4412), 2504 states have internal predecessors, (4412), 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:28:59,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 4412 transitions. [2025-01-09 04:28:59,689 INFO L78 Accepts]: Start accepts. Automaton has 2505 states and 4412 transitions. Word has length 229 [2025-01-09 04:28:59,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:28:59,690 INFO L471 AbstractCegarLoop]: Abstraction has 2505 states and 4412 transitions. [2025-01-09 04:28:59,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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:28:59,690 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 4412 transitions. [2025-01-09 04:28:59,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-01-09 04:28:59,693 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:28:59,693 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:59,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:28:59,693 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:28:59,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:28:59,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1866152788, now seen corresponding path program 1 times [2025-01-09 04:28:59,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:28:59,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470491812] [2025-01-09 04:28:59,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:28:59,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:28:59,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-01-09 04:28:59,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-01-09 04:28:59,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:28:59,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:28:59,921 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:28:59,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:28:59,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470491812] [2025-01-09 04:28:59,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470491812] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:28:59,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:28:59,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:28:59,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501541909] [2025-01-09 04:28:59,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:28:59,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:28:59,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:28:59,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:28:59,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:28:59,923 INFO L87 Difference]: Start difference. First operand 2505 states and 4412 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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:28:59,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:28:59,994 INFO L93 Difference]: Finished difference Result 6221 states and 10942 transitions. [2025-01-09 04:28:59,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:28:59,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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 233 [2025-01-09 04:28:59,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:29:00,010 INFO L225 Difference]: With dead ends: 6221 [2025-01-09 04:29:00,011 INFO L226 Difference]: Without dead ends: 4267 [2025-01-09 04:29:00,016 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:29:00,017 INFO L435 NwaCegarLoop]: 1238 mSDtfsCounter, 211 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 2420 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:29:00,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 2420 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:29:00,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4267 states. [2025-01-09 04:29:00,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4267 to 4249. [2025-01-09 04:29:00,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4249 states, 4248 states have (on average 1.7542372881355932) internal successors, (7452), 4248 states have internal predecessors, (7452), 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:29:00,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4249 states to 4249 states and 7452 transitions. [2025-01-09 04:29:00,133 INFO L78 Accepts]: Start accepts. Automaton has 4249 states and 7452 transitions. Word has length 233 [2025-01-09 04:29:00,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:29:00,133 INFO L471 AbstractCegarLoop]: Abstraction has 4249 states and 7452 transitions. [2025-01-09 04:29:00,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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:29:00,134 INFO L276 IsEmpty]: Start isEmpty. Operand 4249 states and 7452 transitions. [2025-01-09 04:29:00,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-01-09 04:29:00,137 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:29:00,137 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:00,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:29:00,138 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:29:00,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:29:00,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1567045294, now seen corresponding path program 1 times [2025-01-09 04:29:00,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:29:00,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47281961] [2025-01-09 04:29:00,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:29:00,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:29:00,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-01-09 04:29:00,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-01-09 04:29:00,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:29:00,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:29:00,582 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:29:00,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:29:00,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47281961] [2025-01-09 04:29:00,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47281961] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:29:00,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:29:00,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:29:00,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106091938] [2025-01-09 04:29:00,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:29:00,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:29:00,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:29:00,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:29:00,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:29:00,584 INFO L87 Difference]: Start difference. First operand 4249 states and 7452 transitions. Second operand has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 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:29:01,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:29:01,144 INFO L93 Difference]: Finished difference Result 25437 states and 44870 transitions. [2025-01-09 04:29:01,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 04:29:01,144 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 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 237 [2025-01-09 04:29:01,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:29:01,211 INFO L225 Difference]: With dead ends: 25437 [2025-01-09 04:29:01,211 INFO L226 Difference]: Without dead ends: 21739 [2025-01-09 04:29:01,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:29:01,226 INFO L435 NwaCegarLoop]: 1241 mSDtfsCounter, 3406 mSDsluCounter, 9767 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3406 SdHoareTripleChecker+Valid, 11008 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:29:01,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3406 Valid, 11008 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:29:01,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21739 states. [2025-01-09 04:29:01,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21739 to 7803. [2025-01-09 04:29:01,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7803 states, 7802 states have (on average 1.7524993591386824) internal successors, (13673), 7802 states have internal predecessors, (13673), 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:29:01,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7803 states to 7803 states and 13673 transitions. [2025-01-09 04:29:01,589 INFO L78 Accepts]: Start accepts. Automaton has 7803 states and 13673 transitions. Word has length 237 [2025-01-09 04:29:01,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:29:01,589 INFO L471 AbstractCegarLoop]: Abstraction has 7803 states and 13673 transitions. [2025-01-09 04:29:01,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 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:29:01,589 INFO L276 IsEmpty]: Start isEmpty. Operand 7803 states and 13673 transitions. [2025-01-09 04:29:01,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-01-09 04:29:01,594 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:29:01,594 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:01,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:29:01,594 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:29:01,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:29:01,595 INFO L85 PathProgramCache]: Analyzing trace with hash -932615526, now seen corresponding path program 1 times [2025-01-09 04:29:01,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:29:01,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546594967] [2025-01-09 04:29:01,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:29:01,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:29:01,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-01-09 04:29:01,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-01-09 04:29:01,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:29:01,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:29:01,817 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:29:01,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:29:01,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546594967] [2025-01-09 04:29:01,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546594967] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:29:01,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:29:01,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:29:01,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14644861] [2025-01-09 04:29:01,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:29:01,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:29:01,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:29:01,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:29:01,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:29:01,819 INFO L87 Difference]: Start difference. First operand 7803 states and 13673 transitions. Second operand has 4 states, 4 states have (on average 59.5) internal successors, (238), 4 states have internal predecessors, (238), 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:29:02,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:29:02,026 INFO L93 Difference]: Finished difference Result 22737 states and 39991 transitions. [2025-01-09 04:29:02,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:29:02,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.5) internal successors, (238), 4 states have internal predecessors, (238), 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 238 [2025-01-09 04:29:02,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:29:02,057 INFO L225 Difference]: With dead ends: 22737 [2025-01-09 04:29:02,057 INFO L226 Difference]: Without dead ends: 15485 [2025-01-09 04:29:02,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:29:02,071 INFO L435 NwaCegarLoop]: 1233 mSDtfsCounter, 781 mSDsluCounter, 2469 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 3702 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:29:02,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 3702 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:29:02,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15485 states. [2025-01-09 04:29:02,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15485 to 11611. [2025-01-09 04:29:02,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11611 states, 11610 states have (on average 1.753316106804479) internal successors, (20356), 11610 states have internal predecessors, (20356), 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:29:02,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11611 states to 11611 states and 20356 transitions. [2025-01-09 04:29:02,341 INFO L78 Accepts]: Start accepts. Automaton has 11611 states and 20356 transitions. Word has length 238 [2025-01-09 04:29:02,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:29:02,342 INFO L471 AbstractCegarLoop]: Abstraction has 11611 states and 20356 transitions. [2025-01-09 04:29:02,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.5) internal successors, (238), 4 states have internal predecessors, (238), 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:29:02,342 INFO L276 IsEmpty]: Start isEmpty. Operand 11611 states and 20356 transitions. [2025-01-09 04:29:02,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-01-09 04:29:02,348 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:29:02,348 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:02,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:29:02,349 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:29:02,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:29:02,349 INFO L85 PathProgramCache]: Analyzing trace with hash -943685275, now seen corresponding path program 1 times [2025-01-09 04:29:02,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:29:02,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879673251] [2025-01-09 04:29:02,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:29:02,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:29:02,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-01-09 04:29:02,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-01-09 04:29:02,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:29:02,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:29:02,642 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:29:02,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:29:02,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879673251] [2025-01-09 04:29:02,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879673251] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:29:02,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:29:02,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:29:02,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134397489] [2025-01-09 04:29:02,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:29:02,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:29:02,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:29:02,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:29:02,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:29:02,645 INFO L87 Difference]: Start difference. First operand 11611 states and 20356 transitions. Second operand has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 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:29:02,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:29:02,927 INFO L93 Difference]: Finished difference Result 34131 states and 59931 transitions. [2025-01-09 04:29:02,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:29:02,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 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 239 [2025-01-09 04:29:02,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:29:02,974 INFO L225 Difference]: With dead ends: 34131 [2025-01-09 04:29:02,974 INFO L226 Difference]: Without dead ends: 23071 [2025-01-09 04:29:02,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:29:02,995 INFO L435 NwaCegarLoop]: 1238 mSDtfsCounter, 779 mSDsluCounter, 2669 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 3907 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:29:02,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 3907 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:29:03,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23071 states. [2025-01-09 04:29:03,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23071 to 17293. [2025-01-09 04:29:03,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17293 states, 17292 states have (on average 1.7502891510525098) internal successors, (30266), 17292 states have internal predecessors, (30266), 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:29:03,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17293 states to 17293 states and 30266 transitions. [2025-01-09 04:29:03,494 INFO L78 Accepts]: Start accepts. Automaton has 17293 states and 30266 transitions. Word has length 239 [2025-01-09 04:29:03,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:29:03,494 INFO L471 AbstractCegarLoop]: Abstraction has 17293 states and 30266 transitions. [2025-01-09 04:29:03,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 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:29:03,495 INFO L276 IsEmpty]: Start isEmpty. Operand 17293 states and 30266 transitions. [2025-01-09 04:29:03,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-01-09 04:29:03,502 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:29:03,503 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:03,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:29:03,503 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:29:03,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:29:03,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1117843151, now seen corresponding path program 1 times [2025-01-09 04:29:03,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:29:03,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590538614] [2025-01-09 04:29:03,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:29:03,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:29:03,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-01-09 04:29:03,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-01-09 04:29:03,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:29:03,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:29:03,725 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:29:03,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:29:03,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590538614] [2025-01-09 04:29:03,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590538614] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:29:03,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:29:03,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:29:03,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980367613] [2025-01-09 04:29:03,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:29:03,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:29:03,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:29:03,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:29:03,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:29:03,726 INFO L87 Difference]: Start difference. First operand 17293 states and 30266 transitions. Second operand has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 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:29:04,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:29:04,058 INFO L93 Difference]: Finished difference Result 51239 states and 89823 transitions. [2025-01-09 04:29:04,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:29:04,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 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 240 [2025-01-09 04:29:04,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:29:04,123 INFO L225 Difference]: With dead ends: 51239 [2025-01-09 04:29:04,123 INFO L226 Difference]: Without dead ends: 34497 [2025-01-09 04:29:04,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:29:04,147 INFO L435 NwaCegarLoop]: 1230 mSDtfsCounter, 777 mSDsluCounter, 2671 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 3901 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:29:04,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 3901 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:29:04,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34497 states. [2025-01-09 04:29:04,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34497 to 25825. [2025-01-09 04:29:04,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25825 states, 25824 states have (on average 1.747366790582404) internal successors, (45124), 25824 states have internal predecessors, (45124), 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:29:04,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25825 states to 25825 states and 45124 transitions. [2025-01-09 04:29:04,897 INFO L78 Accepts]: Start accepts. Automaton has 25825 states and 45124 transitions. Word has length 240 [2025-01-09 04:29:04,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:29:04,898 INFO L471 AbstractCegarLoop]: Abstraction has 25825 states and 45124 transitions. [2025-01-09 04:29:04,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 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:29:04,898 INFO L276 IsEmpty]: Start isEmpty. Operand 25825 states and 45124 transitions. [2025-01-09 04:29:04,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2025-01-09 04:29:04,908 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:29:04,908 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:04,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:29:04,908 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:29:04,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:29:04,909 INFO L85 PathProgramCache]: Analyzing trace with hash -2018227761, now seen corresponding path program 1 times [2025-01-09 04:29:04,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:29:04,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855047113] [2025-01-09 04:29:04,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:29:04,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:29:04,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-01-09 04:29:04,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-01-09 04:29:04,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:29:04,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:29:05,060 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:29:05,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:29:05,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855047113] [2025-01-09 04:29:05,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855047113] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:29:05,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:29:05,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:29:05,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617622556] [2025-01-09 04:29:05,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:29:05,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:29:05,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:29:05,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:29:05,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:29:05,062 INFO L87 Difference]: Start difference. First operand 25825 states and 45124 transitions. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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:29:05,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:29:05,512 INFO L93 Difference]: Finished difference Result 58012 states and 101594 transitions. [2025-01-09 04:29:05,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:29:05,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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 241 [2025-01-09 04:29:05,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:29:05,597 INFO L225 Difference]: With dead ends: 58012 [2025-01-09 04:29:05,597 INFO L226 Difference]: Without dead ends: 40273 [2025-01-09 04:29:05,624 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:29:05,625 INFO L435 NwaCegarLoop]: 1454 mSDtfsCounter, 242 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 2657 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:29:05,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 2657 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:29:05,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40273 states. [2025-01-09 04:29:06,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40273 to 40271. [2025-01-09 04:29:06,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40271 states, 40270 states have (on average 1.7433821703501367) internal successors, (70206), 40270 states have internal predecessors, (70206), 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:29:06,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40271 states to 40271 states and 70206 transitions. [2025-01-09 04:29:06,399 INFO L78 Accepts]: Start accepts. Automaton has 40271 states and 70206 transitions. Word has length 241 [2025-01-09 04:29:06,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:29:06,400 INFO L471 AbstractCegarLoop]: Abstraction has 40271 states and 70206 transitions. [2025-01-09 04:29:06,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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:29:06,401 INFO L276 IsEmpty]: Start isEmpty. Operand 40271 states and 70206 transitions. [2025-01-09 04:29:06,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2025-01-09 04:29:06,405 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:29:06,405 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:06,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:29:06,405 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:29:06,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:29:06,406 INFO L85 PathProgramCache]: Analyzing trace with hash 2092206287, now seen corresponding path program 1 times [2025-01-09 04:29:06,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:29:06,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876964270] [2025-01-09 04:29:06,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:29:06,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:29:06,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-01-09 04:29:06,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-01-09 04:29:06,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:29:06,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:29:06,546 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:29:06,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:29:06,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876964270] [2025-01-09 04:29:06,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876964270] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:29:06,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:29:06,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:29:06,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472509097] [2025-01-09 04:29:06,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:29:06,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:29:06,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:29:06,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:29:06,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:29:06,549 INFO L87 Difference]: Start difference. First operand 40271 states and 70206 transitions. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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:29:07,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:29:07,046 INFO L93 Difference]: Finished difference Result 90046 states and 156896 transitions. [2025-01-09 04:29:07,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:29:07,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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 241 [2025-01-09 04:29:07,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:29:07,187 INFO L225 Difference]: With dead ends: 90046 [2025-01-09 04:29:07,188 INFO L226 Difference]: Without dead ends: 62413 [2025-01-09 04:29:07,230 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:29:07,231 INFO L435 NwaCegarLoop]: 1442 mSDtfsCounter, 234 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 2646 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:29:07,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 2646 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:29:07,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62413 states. [2025-01-09 04:29:08,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62413 to 62411. [2025-01-09 04:29:08,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62411 states, 62410 states have (on average 1.7351546226566255) internal successors, (108291), 62410 states have internal predecessors, (108291), 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:29:08,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62411 states to 62411 states and 108291 transitions. [2025-01-09 04:29:08,286 INFO L78 Accepts]: Start accepts. Automaton has 62411 states and 108291 transitions. Word has length 241 [2025-01-09 04:29:08,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:29:08,286 INFO L471 AbstractCegarLoop]: Abstraction has 62411 states and 108291 transitions. [2025-01-09 04:29:08,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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:29:08,286 INFO L276 IsEmpty]: Start isEmpty. Operand 62411 states and 108291 transitions. [2025-01-09 04:29:08,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2025-01-09 04:29:08,289 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:29:08,289 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:08,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:29:08,290 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:29:08,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:29:08,290 INFO L85 PathProgramCache]: Analyzing trace with hash -2050013745, now seen corresponding path program 1 times [2025-01-09 04:29:08,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:29:08,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978332947] [2025-01-09 04:29:08,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:29:08,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:29:08,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-01-09 04:29:08,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-01-09 04:29:08,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:29:08,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:29:08,428 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:29:08,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:29:08,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978332947] [2025-01-09 04:29:08,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978332947] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:29:08,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:29:08,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:29:08,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418541772] [2025-01-09 04:29:08,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:29:08,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:29:08,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:29:08,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:29:08,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:29:08,430 INFO L87 Difference]: Start difference. First operand 62411 states and 108291 transitions. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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:29:09,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:29:09,165 INFO L93 Difference]: Finished difference Result 122729 states and 212880 transitions. [2025-01-09 04:29:09,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:29:09,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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 241 [2025-01-09 04:29:09,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:29:09,348 INFO L225 Difference]: With dead ends: 122729 [2025-01-09 04:29:09,349 INFO L226 Difference]: Without dead ends: 89047 [2025-01-09 04:29:09,384 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:29:09,386 INFO L435 NwaCegarLoop]: 1333 mSDtfsCounter, 210 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 2540 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:29:09,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 2540 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:29:09,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89047 states. [2025-01-09 04:29:10,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89047 to 89045. [2025-01-09 04:29:10,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89045 states, 89044 states have (on average 1.7273258164502943) internal successors, (153808), 89044 states have internal predecessors, (153808), 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:29:10,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89045 states to 89045 states and 153808 transitions. [2025-01-09 04:29:10,707 INFO L78 Accepts]: Start accepts. Automaton has 89045 states and 153808 transitions. Word has length 241 [2025-01-09 04:29:10,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:29:10,707 INFO L471 AbstractCegarLoop]: Abstraction has 89045 states and 153808 transitions. [2025-01-09 04:29:10,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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:29:10,708 INFO L276 IsEmpty]: Start isEmpty. Operand 89045 states and 153808 transitions. [2025-01-09 04:29:10,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2025-01-09 04:29:10,710 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:29:10,710 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:10,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:29:10,711 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:29:10,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:29:10,711 INFO L85 PathProgramCache]: Analyzing trace with hash -2052765668, now seen corresponding path program 1 times [2025-01-09 04:29:10,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:29:10,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995277125] [2025-01-09 04:29:10,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:29:10,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:29:10,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-01-09 04:29:10,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-01-09 04:29:10,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:29:10,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:29:10,871 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:29:10,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:29:10,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995277125] [2025-01-09 04:29:10,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995277125] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:29:10,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:29:10,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:29:10,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942830294] [2025-01-09 04:29:10,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:29:10,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:29:10,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:29:10,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:29:10,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:29:10,872 INFO L87 Difference]: Start difference. First operand 89045 states and 153808 transitions. Second operand has 4 states, 4 states have (on average 60.25) internal successors, (241), 4 states have internal predecessors, (241), 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:29:12,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:29:12,282 INFO L93 Difference]: Finished difference Result 269480 states and 466567 transitions. [2025-01-09 04:29:12,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:29:12,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.25) internal successors, (241), 4 states have internal predecessors, (241), 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 241 [2025-01-09 04:29:12,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:29:12,805 INFO L225 Difference]: With dead ends: 269480 [2025-01-09 04:29:12,806 INFO L226 Difference]: Without dead ends: 181164 [2025-01-09 04:29:12,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:29:12,878 INFO L435 NwaCegarLoop]: 1287 mSDtfsCounter, 775 mSDsluCounter, 2673 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 3960 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:29:12,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 3960 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:29:13,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181164 states. [2025-01-09 04:29:14,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181164 to 134675. [2025-01-09 04:29:14,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134675 states, 134674 states have (on average 1.7240818569285832) internal successors, (232189), 134674 states have internal predecessors, (232189), 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:29:15,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134675 states to 134675 states and 232189 transitions. [2025-01-09 04:29:15,303 INFO L78 Accepts]: Start accepts. Automaton has 134675 states and 232189 transitions. Word has length 241 [2025-01-09 04:29:15,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:29:15,304 INFO L471 AbstractCegarLoop]: Abstraction has 134675 states and 232189 transitions. [2025-01-09 04:29:15,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.25) internal successors, (241), 4 states have internal predecessors, (241), 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:29:15,304 INFO L276 IsEmpty]: Start isEmpty. Operand 134675 states and 232189 transitions. [2025-01-09 04:29:15,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2025-01-09 04:29:15,305 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:29:15,306 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:15,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:29:15,306 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:29:15,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:29:15,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1556219599, now seen corresponding path program 1 times [2025-01-09 04:29:15,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:29:15,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947681254] [2025-01-09 04:29:15,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:29:15,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:29:15,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-01-09 04:29:15,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-01-09 04:29:15,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:29:15,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:29:15,416 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:29:15,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:29:15,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947681254] [2025-01-09 04:29:15,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947681254] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:29:15,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:29:15,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:29:15,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489342860] [2025-01-09 04:29:15,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:29:15,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:29:15,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:29:15,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:29:15,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:29:15,417 INFO L87 Difference]: Start difference. First operand 134675 states and 232189 transitions. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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:29:16,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:29:16,893 INFO L93 Difference]: Finished difference Result 300939 states and 518349 transitions. [2025-01-09 04:29:16,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:29:16,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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 241 [2025-01-09 04:29:16,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:29:17,264 INFO L225 Difference]: With dead ends: 300939 [2025-01-09 04:29:17,264 INFO L226 Difference]: Without dead ends: 207357 [2025-01-09 04:29:17,514 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:29:17,515 INFO L435 NwaCegarLoop]: 1377 mSDtfsCounter, 218 mSDsluCounter, 1206 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 2583 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:29:17,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 2583 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:29:17,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207357 states. [2025-01-09 04:29:20,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207357 to 207355. [2025-01-09 04:29:20,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207355 states, 207354 states have (on average 1.71343692429372) internal successors, (355288), 207354 states have internal predecessors, (355288), 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:29:20,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207355 states to 207355 states and 355288 transitions. [2025-01-09 04:29:20,913 INFO L78 Accepts]: Start accepts. Automaton has 207355 states and 355288 transitions. Word has length 241 [2025-01-09 04:29:20,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:29:20,913 INFO L471 AbstractCegarLoop]: Abstraction has 207355 states and 355288 transitions. [2025-01-09 04:29:20,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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:29:20,913 INFO L276 IsEmpty]: Start isEmpty. Operand 207355 states and 355288 transitions. [2025-01-09 04:29:20,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2025-01-09 04:29:20,915 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:29:20,915 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:20,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:29:20,915 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:29:20,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:29:20,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1184643121, now seen corresponding path program 1 times [2025-01-09 04:29:20,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:29:20,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408523675] [2025-01-09 04:29:20,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:29:20,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:29:20,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-01-09 04:29:20,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-01-09 04:29:20,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:29:20,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:29:21,075 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:29:21,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:29:21,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408523675] [2025-01-09 04:29:21,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408523675] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:29:21,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:29:21,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:29:21,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278661483] [2025-01-09 04:29:21,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:29:21,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:29:21,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:29:21,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:29:21,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:29:21,077 INFO L87 Difference]: Start difference. First operand 207355 states and 355288 transitions. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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:29:23,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:29:23,593 INFO L93 Difference]: Finished difference Result 462100 states and 790694 transitions. [2025-01-09 04:29:23,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:29:23,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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 241 [2025-01-09 04:29:23,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:29:24,202 INFO L225 Difference]: With dead ends: 462100 [2025-01-09 04:29:24,203 INFO L226 Difference]: Without dead ends: 317355 [2025-01-09 04:29:24,318 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:29:24,319 INFO L435 NwaCegarLoop]: 1422 mSDtfsCounter, 226 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 2627 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:29:24,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 2627 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:29:24,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317355 states. [2025-01-09 04:29:28,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317355 to 317353. [2025-01-09 04:29:28,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317353 states, 317352 states have (on average 1.7007644508306234) internal successors, (539741), 317352 states have internal predecessors, (539741), 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:29:29,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317353 states to 317353 states and 539741 transitions. [2025-01-09 04:29:29,462 INFO L78 Accepts]: Start accepts. Automaton has 317353 states and 539741 transitions. Word has length 241 [2025-01-09 04:29:29,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:29:29,462 INFO L471 AbstractCegarLoop]: Abstraction has 317353 states and 539741 transitions. [2025-01-09 04:29:29,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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:29:29,463 INFO L276 IsEmpty]: Start isEmpty. Operand 317353 states and 539741 transitions. [2025-01-09 04:29:29,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-01-09 04:29:29,464 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:29:29,464 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:29,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:29:29,464 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:29:29,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:29:29,465 INFO L85 PathProgramCache]: Analyzing trace with hash -801588280, now seen corresponding path program 1 times [2025-01-09 04:29:29,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:29:29,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165556238] [2025-01-09 04:29:29,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:29:29,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:29:29,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-01-09 04:29:29,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-01-09 04:29:29,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:29:29,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:29:29,661 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:29:29,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:29:29,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165556238] [2025-01-09 04:29:29,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165556238] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:29:29,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:29:29,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:29:29,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207710848] [2025-01-09 04:29:29,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:29:29,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:29:29,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:29:29,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:29:29,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:29:29,663 INFO L87 Difference]: Start difference. First operand 317353 states and 539741 transitions. Second operand has 4 states, 4 states have (on average 60.5) internal successors, (242), 4 states have internal predecessors, (242), 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:29:35,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:29:35,468 INFO L93 Difference]: Finished difference Result 1039785 states and 1769869 transitions. [2025-01-09 04:29:35,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:29:35,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.5) internal successors, (242), 4 states have internal predecessors, (242), 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 242 [2025-01-09 04:29:35,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted.