./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.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-reduced/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.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 9722ff92ac7fe0a04a9fad473fb73ed6306a5571935abb587177743f8c4febdd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:57:50,777 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:57:50,826 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:57:50,830 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:57:50,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:57:50,846 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:57:50,846 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:57:50,846 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:57:50,846 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:57:50,846 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:57:50,846 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:57:50,846 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:57:50,847 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:57:50,847 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:57:50,847 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:57:50,847 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:57:50,847 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:57:50,847 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:57:50,847 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:57:50,847 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:57:50,847 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:57:50,847 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:57:50,847 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:57:50,847 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:57:50,847 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:57:50,847 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:57:50,847 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:57:50,847 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:57:50,848 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:57:50,848 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:57:50,848 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:57:50,848 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:57:50,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:57:50,848 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:57:50,848 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:57:50,848 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:57:50,848 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:57:50,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:57:50,848 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:57:50,848 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:57:50,848 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:57:50,848 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:57:50,848 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:57:50,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:57:50,848 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:57:50,848 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:57:50,848 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:57:50,848 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:57:50,849 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 -> 9722ff92ac7fe0a04a9fad473fb73ed6306a5571935abb587177743f8c4febdd [2025-01-09 04:57:51,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:57:51,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:57:51,108 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:57:51,109 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:57:51,109 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:57:51,110 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2025-01-09 04:57:52,452 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/05abe3a69/faaba7698d6e4c2982561336d2c1727c/FLAG393bcdc83 [2025-01-09 04:57:52,809 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:57:52,812 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2025-01-09 04:57:52,825 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/05abe3a69/faaba7698d6e4c2982561336d2c1727c/FLAG393bcdc83 [2025-01-09 04:57:53,024 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/05abe3a69/faaba7698d6e4c2982561336d2c1727c [2025-01-09 04:57:53,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:57:53,027 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:57:53,028 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:57:53,031 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:57:53,035 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:57:53,037 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:57:53" (1/1) ... [2025-01-09 04:57:53,038 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@370a473a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:57:53, skipping insertion in model container [2025-01-09 04:57:53,038 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:57:53" (1/1) ... [2025-01-09 04:57:53,086 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:57:53,402 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-reduced/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c[26802,26815] [2025-01-09 04:57:53,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:57:53,520 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:57:53,618 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-reduced/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c[26802,26815] [2025-01-09 04:57:53,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:57:53,693 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:57:53,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:57:53 WrapperNode [2025-01-09 04:57:53,696 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:57:53,697 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:57:53,697 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:57:53,697 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:57:53,703 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:57:53" (1/1) ... [2025-01-09 04:57:53,731 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:57:53" (1/1) ... [2025-01-09 04:57:53,814 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2527 [2025-01-09 04:57:53,815 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:57:53,815 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:57:53,815 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:57:53,816 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:57:53,822 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:57:53" (1/1) ... [2025-01-09 04:57:53,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:57:53" (1/1) ... [2025-01-09 04:57:53,834 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:57:53" (1/1) ... [2025-01-09 04:57:53,877 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:57:53,878 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:57:53" (1/1) ... [2025-01-09 04:57:53,879 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:57:53" (1/1) ... [2025-01-09 04:57:53,912 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:57:53" (1/1) ... [2025-01-09 04:57:53,919 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:57:53" (1/1) ... [2025-01-09 04:57:53,939 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:57:53" (1/1) ... [2025-01-09 04:57:53,952 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:57:53" (1/1) ... [2025-01-09 04:57:53,960 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:57:53" (1/1) ... [2025-01-09 04:57:53,974 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:57:53,976 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:57:53,976 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:57:53,976 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:57:53,977 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:57:53" (1/1) ... [2025-01-09 04:57:53,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:57:53,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:57:54,011 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:57:54,043 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:57:54,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:57:54,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:57:54,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:57:54,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:57:54,212 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:57:54,213 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:57:56,329 INFO L? ?]: Removed 188 outVars from TransFormulas that were not future-live. [2025-01-09 04:57:56,329 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:57:56,348 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:57:56,348 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:57:56,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:57:56 BoogieIcfgContainer [2025-01-09 04:57:56,349 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:57:56,351 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:57:56,351 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:57:56,355 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:57:56,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:57:53" (1/3) ... [2025-01-09 04:57:56,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@278a260e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:57:56, skipping insertion in model container [2025-01-09 04:57:56,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:57:53" (2/3) ... [2025-01-09 04:57:56,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@278a260e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:57:56, skipping insertion in model container [2025-01-09 04:57:56,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:57:56" (3/3) ... [2025-01-09 04:57:56,358 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2025-01-09 04:57:56,370 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:57:56,374 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c that has 1 procedures, 636 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 04:57:56,435 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:57:56,445 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;@183a4831, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:57:56,446 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:57:56,451 INFO L276 IsEmpty]: Start isEmpty. Operand has 636 states, 634 states have (on average 1.7854889589905363) internal successors, (1132), 635 states have internal predecessors, (1132), 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:57:56,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-01-09 04:57:56,466 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:57:56,467 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, 1, 1, 1, 1] [2025-01-09 04:57:56,467 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:57:56,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:57:56,472 INFO L85 PathProgramCache]: Analyzing trace with hash 862105876, now seen corresponding path program 1 times [2025-01-09 04:57:56,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:57:56,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644763] [2025-01-09 04:57:56,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:57:56,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:57:56,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-01-09 04:57:56,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-01-09 04:57:56,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:57:56,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:57:57,280 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:57:57,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:57:57,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644763] [2025-01-09 04:57:57,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644763] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:57:57,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:57:57,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:57:57,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160272569] [2025-01-09 04:57:57,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:57:57,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:57:57,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:57:57,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:57:57,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:57:57,307 INFO L87 Difference]: Start difference. First operand has 636 states, 634 states have (on average 1.7854889589905363) internal successors, (1132), 635 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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:57:57,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:57:57,460 INFO L93 Difference]: Finished difference Result 1167 states and 2055 transitions. [2025-01-09 04:57:57,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:57:57,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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 246 [2025-01-09 04:57:57,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:57:57,485 INFO L225 Difference]: With dead ends: 1167 [2025-01-09 04:57:57,486 INFO L226 Difference]: Without dead ends: 972 [2025-01-09 04:57:57,490 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:57:57,493 INFO L435 NwaCegarLoop]: 1086 mSDtfsCounter, 662 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 1953 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:57:57,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 1953 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:57:57,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2025-01-09 04:57:57,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 970. [2025-01-09 04:57:57,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 1.5820433436532508) internal successors, (1533), 969 states have internal predecessors, (1533), 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:57:57,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1533 transitions. [2025-01-09 04:57:57,580 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1533 transitions. Word has length 246 [2025-01-09 04:57:57,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:57:57,581 INFO L471 AbstractCegarLoop]: Abstraction has 970 states and 1533 transitions. [2025-01-09 04:57:57,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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:57:57,585 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1533 transitions. [2025-01-09 04:57:57,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-01-09 04:57:57,595 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:57:57,595 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, 1, 1, 1, 1] [2025-01-09 04:57:57,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:57:57,596 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:57:57,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:57:57,596 INFO L85 PathProgramCache]: Analyzing trace with hash 883598316, now seen corresponding path program 1 times [2025-01-09 04:57:57,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:57:57,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568941433] [2025-01-09 04:57:57,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:57:57,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:57:57,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-01-09 04:57:58,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-01-09 04:57:58,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:57:58,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:57:58,644 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:57:58,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:57:58,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568941433] [2025-01-09 04:57:58,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568941433] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:57:58,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:57:58,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:57:58,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586378449] [2025-01-09 04:57:58,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:57:58,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:57:58,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:57:58,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:57:58,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:57:58,646 INFO L87 Difference]: Start difference. First operand 970 states and 1533 transitions. Second operand has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 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:57:58,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:57:58,887 INFO L93 Difference]: Finished difference Result 4730 states and 7458 transitions. [2025-01-09 04:57:58,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:57:58,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 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 246 [2025-01-09 04:57:58,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:57:58,900 INFO L225 Difference]: With dead ends: 4730 [2025-01-09 04:57:58,900 INFO L226 Difference]: Without dead ends: 3771 [2025-01-09 04:57:58,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:57:58,904 INFO L435 NwaCegarLoop]: 1412 mSDtfsCounter, 3222 mSDsluCounter, 2328 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3222 SdHoareTripleChecker+Valid, 3740 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:57:58,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3222 Valid, 3740 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:57:58,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3771 states. [2025-01-09 04:57:58,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3771 to 1898. [2025-01-09 04:57:58,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1898 states, 1897 states have (on average 1.5709014232999472) internal successors, (2980), 1897 states have internal predecessors, (2980), 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:57:58,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 2980 transitions. [2025-01-09 04:57:58,968 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 2980 transitions. Word has length 246 [2025-01-09 04:57:58,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:57:58,969 INFO L471 AbstractCegarLoop]: Abstraction has 1898 states and 2980 transitions. [2025-01-09 04:57:58,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 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:57:58,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2980 transitions. [2025-01-09 04:57:58,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-01-09 04:57:58,973 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:57:58,973 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:58,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:57:58,974 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:57:58,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:57:58,974 INFO L85 PathProgramCache]: Analyzing trace with hash -233245184, now seen corresponding path program 1 times [2025-01-09 04:57:58,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:57:58,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713706332] [2025-01-09 04:57:58,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:57:58,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:57:59,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-01-09 04:57:59,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-01-09 04:57:59,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:57:59,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:57:59,174 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:57:59,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:57:59,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713706332] [2025-01-09 04:57:59,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713706332] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:57:59,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:57:59,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:57:59,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595461987] [2025-01-09 04:57:59,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:57:59,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:57:59,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:57:59,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:57:59,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:57:59,176 INFO L87 Difference]: Start difference. First operand 1898 states and 2980 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 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:57:59,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:57:59,252 INFO L93 Difference]: Finished difference Result 5497 states and 8596 transitions. [2025-01-09 04:57:59,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:57:59,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 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 248 [2025-01-09 04:57:59,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:57:59,262 INFO L225 Difference]: With dead ends: 5497 [2025-01-09 04:57:59,262 INFO L226 Difference]: Without dead ends: 3724 [2025-01-09 04:57:59,264 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:57:59,264 INFO L435 NwaCegarLoop]: 1933 mSDtfsCounter, 860 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 2881 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:57:59,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 2881 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:57:59,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3724 states. [2025-01-09 04:57:59,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3724 to 3722. [2025-01-09 04:57:59,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3722 states, 3721 states have (on average 1.5616769685568395) internal successors, (5811), 3721 states have internal predecessors, (5811), 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:57:59,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3722 states to 3722 states and 5811 transitions. [2025-01-09 04:57:59,365 INFO L78 Accepts]: Start accepts. Automaton has 3722 states and 5811 transitions. Word has length 248 [2025-01-09 04:57:59,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:57:59,365 INFO L471 AbstractCegarLoop]: Abstraction has 3722 states and 5811 transitions. [2025-01-09 04:57:59,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 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:57:59,365 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 5811 transitions. [2025-01-09 04:57:59,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-01-09 04:57:59,370 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:57:59,370 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, 1, 1, 1, 1, 1, 1] [2025-01-09 04:57:59,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:57:59,370 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:57:59,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:57:59,371 INFO L85 PathProgramCache]: Analyzing trace with hash -170222651, now seen corresponding path program 1 times [2025-01-09 04:57:59,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:57:59,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962948352] [2025-01-09 04:57:59,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:57:59,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:57:59,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-01-09 04:57:59,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-01-09 04:57:59,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:57:59,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:57:59,476 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:57:59,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:57:59,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962948352] [2025-01-09 04:57:59,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962948352] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:57:59,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:57:59,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:57:59,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959640609] [2025-01-09 04:57:59,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:57:59,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:57:59,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:57:59,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:57:59,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:57:59,479 INFO L87 Difference]: Start difference. First operand 3722 states and 5811 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 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:57:59,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:57:59,570 INFO L93 Difference]: Finished difference Result 11099 states and 17317 transitions. [2025-01-09 04:57:59,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:57:59,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 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 248 [2025-01-09 04:57:59,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:57:59,590 INFO L225 Difference]: With dead ends: 11099 [2025-01-09 04:57:59,591 INFO L226 Difference]: Without dead ends: 7415 [2025-01-09 04:57:59,596 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:57:59,599 INFO L435 NwaCegarLoop]: 1974 mSDtfsCounter, 984 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 984 SdHoareTripleChecker+Valid, 2959 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:57:59,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [984 Valid, 2959 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:57:59,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7415 states. [2025-01-09 04:57:59,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7415 to 3741. [2025-01-09 04:57:59,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3741 states, 3740 states have (on average 1.5612299465240642) internal successors, (5839), 3740 states have internal predecessors, (5839), 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:57:59,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3741 states to 3741 states and 5839 transitions. [2025-01-09 04:57:59,720 INFO L78 Accepts]: Start accepts. Automaton has 3741 states and 5839 transitions. Word has length 248 [2025-01-09 04:57:59,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:57:59,721 INFO L471 AbstractCegarLoop]: Abstraction has 3741 states and 5839 transitions. [2025-01-09 04:57:59,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 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:57:59,721 INFO L276 IsEmpty]: Start isEmpty. Operand 3741 states and 5839 transitions. [2025-01-09 04:57:59,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-01-09 04:57:59,728 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:57:59,728 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, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:57:59,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:57:59,729 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:57:59,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:57:59,730 INFO L85 PathProgramCache]: Analyzing trace with hash -992528260, now seen corresponding path program 1 times [2025-01-09 04:57:59,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:57:59,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793043244] [2025-01-09 04:57:59,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:57:59,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:57:59,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-01-09 04:57:59,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-01-09 04:57:59,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:57:59,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:57:59,861 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:57:59,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:57:59,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793043244] [2025-01-09 04:57:59,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793043244] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:57:59,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:57:59,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:57:59,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266477053] [2025-01-09 04:57:59,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:57:59,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:57:59,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:57:59,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:57:59,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:57:59,862 INFO L87 Difference]: Start difference. First operand 3741 states and 5839 transitions. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 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:57:59,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:57:59,910 INFO L93 Difference]: Finished difference Result 7444 states and 11611 transitions. [2025-01-09 04:57:59,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:57:59,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 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 249 [2025-01-09 04:57:59,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:57:59,922 INFO L225 Difference]: With dead ends: 7444 [2025-01-09 04:57:59,922 INFO L226 Difference]: Without dead ends: 3759 [2025-01-09 04:57:59,926 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:57:59,926 INFO L435 NwaCegarLoop]: 1008 mSDtfsCounter, 5 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2001 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:57:59,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2001 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:57:59,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3759 states. [2025-01-09 04:57:59,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3759 to 3759. [2025-01-09 04:57:59,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3759 states, 3758 states have (on average 1.5593400745077168) internal successors, (5860), 3758 states have internal predecessors, (5860), 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:57:59,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3759 states to 3759 states and 5860 transitions. [2025-01-09 04:57:59,992 INFO L78 Accepts]: Start accepts. Automaton has 3759 states and 5860 transitions. Word has length 249 [2025-01-09 04:57:59,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:57:59,992 INFO L471 AbstractCegarLoop]: Abstraction has 3759 states and 5860 transitions. [2025-01-09 04:57:59,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 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:57:59,993 INFO L276 IsEmpty]: Start isEmpty. Operand 3759 states and 5860 transitions. [2025-01-09 04:57:59,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-01-09 04:57:59,997 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:57:59,997 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:57:59,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:57:59,998 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:57:59,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:57:59,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1666542812, now seen corresponding path program 1 times [2025-01-09 04:57:59,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:57:59,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579640109] [2025-01-09 04:57:59,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:57:59,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:00,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-01-09 04:58:00,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-01-09 04:58:00,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:00,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:00,127 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:58:00,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:00,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579640109] [2025-01-09 04:58:00,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579640109] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:00,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:00,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:58:00,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334628573] [2025-01-09 04:58:00,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:00,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:58:00,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:00,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:58:00,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:58:00,129 INFO L87 Difference]: Start difference. First operand 3759 states and 5860 transitions. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 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:58:00,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:00,226 INFO L93 Difference]: Finished difference Result 8393 states and 13180 transitions. [2025-01-09 04:58:00,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:58:00,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 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 250 [2025-01-09 04:58:00,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:00,240 INFO L225 Difference]: With dead ends: 8393 [2025-01-09 04:58:00,240 INFO L226 Difference]: Without dead ends: 5453 [2025-01-09 04:58:00,243 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:58:00,243 INFO L435 NwaCegarLoop]: 1344 mSDtfsCounter, 536 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 2127 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:58:00,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 2127 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:58:00,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5453 states. [2025-01-09 04:58:00,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5453 to 4735. [2025-01-09 04:58:00,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4735 states, 4734 states have (on average 1.5804816223067173) internal successors, (7482), 4734 states have internal predecessors, (7482), 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:58:00,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4735 states to 4735 states and 7482 transitions. [2025-01-09 04:58:00,318 INFO L78 Accepts]: Start accepts. Automaton has 4735 states and 7482 transitions. Word has length 250 [2025-01-09 04:58:00,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:00,318 INFO L471 AbstractCegarLoop]: Abstraction has 4735 states and 7482 transitions. [2025-01-09 04:58:00,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 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:58:00,318 INFO L276 IsEmpty]: Start isEmpty. Operand 4735 states and 7482 transitions. [2025-01-09 04:58:00,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-01-09 04:58:00,322 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:00,323 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:58:00,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:58:00,323 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:00,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:00,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1293164104, now seen corresponding path program 1 times [2025-01-09 04:58:00,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:00,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997098801] [2025-01-09 04:58:00,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:00,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:00,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-01-09 04:58:00,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-01-09 04:58:00,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:00,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:00,955 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:58:00,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:00,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997098801] [2025-01-09 04:58:00,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997098801] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:00,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:00,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:58:00,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952288557] [2025-01-09 04:58:00,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:00,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:58:00,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:00,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:58:00,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:58:00,957 INFO L87 Difference]: Start difference. First operand 4735 states and 7482 transitions. Second operand has 4 states, 4 states have (on average 62.5) internal successors, (250), 4 states have internal predecessors, (250), 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:58:01,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:01,048 INFO L93 Difference]: Finished difference Result 13714 states and 21593 transitions. [2025-01-09 04:58:01,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:58:01,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 4 states have internal predecessors, (250), 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 250 [2025-01-09 04:58:01,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:01,075 INFO L225 Difference]: With dead ends: 13714 [2025-01-09 04:58:01,075 INFO L226 Difference]: Without dead ends: 9304 [2025-01-09 04:58:01,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:58:01,083 INFO L435 NwaCegarLoop]: 1967 mSDtfsCounter, 950 mSDsluCounter, 2949 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 4916 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:58:01,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 4916 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:58:01,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9304 states. [2025-01-09 04:58:01,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9304 to 4942. [2025-01-09 04:58:01,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4942 states, 4941 states have (on average 1.5857113944545638) internal successors, (7835), 4941 states have internal predecessors, (7835), 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:58:01,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4942 states to 4942 states and 7835 transitions. [2025-01-09 04:58:01,236 INFO L78 Accepts]: Start accepts. Automaton has 4942 states and 7835 transitions. Word has length 250 [2025-01-09 04:58:01,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:01,236 INFO L471 AbstractCegarLoop]: Abstraction has 4942 states and 7835 transitions. [2025-01-09 04:58:01,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 4 states have internal predecessors, (250), 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:58:01,237 INFO L276 IsEmpty]: Start isEmpty. Operand 4942 states and 7835 transitions. [2025-01-09 04:58:01,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-01-09 04:58:01,242 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:01,242 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:58:01,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:58:01,242 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:01,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:01,243 INFO L85 PathProgramCache]: Analyzing trace with hash -780645733, now seen corresponding path program 1 times [2025-01-09 04:58:01,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:01,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051274512] [2025-01-09 04:58:01,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:01,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:01,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-01-09 04:58:01,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-01-09 04:58:01,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:01,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:01,360 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:58:01,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:01,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051274512] [2025-01-09 04:58:01,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051274512] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:01,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:01,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:58:01,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597262862] [2025-01-09 04:58:01,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:01,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:58:01,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:01,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:58:01,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:58:01,362 INFO L87 Difference]: Start difference. First operand 4942 states and 7835 transitions. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 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:58:01,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:01,465 INFO L93 Difference]: Finished difference Result 13945 states and 21991 transitions. [2025-01-09 04:58:01,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:58:01,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 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 250 [2025-01-09 04:58:01,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:01,481 INFO L225 Difference]: With dead ends: 13945 [2025-01-09 04:58:01,481 INFO L226 Difference]: Without dead ends: 9419 [2025-01-09 04:58:01,488 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:58:01,489 INFO L435 NwaCegarLoop]: 1934 mSDtfsCounter, 851 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 2879 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:58:01,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 2879 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:58:01,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9419 states. [2025-01-09 04:58:01,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9419 to 9417. [2025-01-09 04:58:01,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9417 states, 9416 states have (on average 1.5717926932880204) internal successors, (14800), 9416 states have internal predecessors, (14800), 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:58:01,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9417 states to 9417 states and 14800 transitions. [2025-01-09 04:58:01,699 INFO L78 Accepts]: Start accepts. Automaton has 9417 states and 14800 transitions. Word has length 250 [2025-01-09 04:58:01,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:01,699 INFO L471 AbstractCegarLoop]: Abstraction has 9417 states and 14800 transitions. [2025-01-09 04:58:01,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 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:58:01,700 INFO L276 IsEmpty]: Start isEmpty. Operand 9417 states and 14800 transitions. [2025-01-09 04:58:01,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-01-09 04:58:01,711 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:01,711 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:58:01,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:58:01,711 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:01,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:01,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1095160341, now seen corresponding path program 1 times [2025-01-09 04:58:01,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:01,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73124043] [2025-01-09 04:58:01,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:01,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:01,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-01-09 04:58:01,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-01-09 04:58:01,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:01,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:01,848 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:58:01,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:01,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73124043] [2025-01-09 04:58:01,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73124043] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:01,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:01,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:58:01,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72258385] [2025-01-09 04:58:01,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:01,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:58:01,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:01,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:58:01,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:58:01,850 INFO L87 Difference]: Start difference. First operand 9417 states and 14800 transitions. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:01,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:01,976 INFO L93 Difference]: Finished difference Result 21381 states and 33938 transitions. [2025-01-09 04:58:01,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:58:01,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 252 [2025-01-09 04:58:01,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:02,004 INFO L225 Difference]: With dead ends: 21381 [2025-01-09 04:58:02,004 INFO L226 Difference]: Without dead ends: 14035 [2025-01-09 04:58:02,017 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:58:02,018 INFO L435 NwaCegarLoop]: 1308 mSDtfsCounter, 517 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 2063 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:58:02,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 2063 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:58:02,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14035 states. [2025-01-09 04:58:02,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14035 to 12865. [2025-01-09 04:58:02,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12865 states, 12864 states have (on average 1.591728855721393) internal successors, (20476), 12864 states have internal predecessors, (20476), 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:58:02,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12865 states to 12865 states and 20476 transitions. [2025-01-09 04:58:02,299 INFO L78 Accepts]: Start accepts. Automaton has 12865 states and 20476 transitions. Word has length 252 [2025-01-09 04:58:02,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:02,300 INFO L471 AbstractCegarLoop]: Abstraction has 12865 states and 20476 transitions. [2025-01-09 04:58:02,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:02,300 INFO L276 IsEmpty]: Start isEmpty. Operand 12865 states and 20476 transitions. [2025-01-09 04:58:02,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-01-09 04:58:02,310 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:02,311 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:58:02,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:58:02,311 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:02,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:02,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1034669459, now seen corresponding path program 1 times [2025-01-09 04:58:02,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:02,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370157059] [2025-01-09 04:58:02,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:02,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:02,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-01-09 04:58:02,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-01-09 04:58:02,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:02,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:02,426 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:58:02,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:02,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370157059] [2025-01-09 04:58:02,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370157059] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:02,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:02,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:58:02,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880376944] [2025-01-09 04:58:02,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:02,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:58:02,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:02,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:58:02,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:58:02,428 INFO L87 Difference]: Start difference. First operand 12865 states and 20476 transitions. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:02,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:02,517 INFO L93 Difference]: Finished difference Result 37033 states and 58717 transitions. [2025-01-09 04:58:02,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:58:02,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 252 [2025-01-09 04:58:02,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:02,564 INFO L225 Difference]: With dead ends: 37033 [2025-01-09 04:58:02,564 INFO L226 Difference]: Without dead ends: 24967 [2025-01-09 04:58:02,585 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:58:02,586 INFO L435 NwaCegarLoop]: 1830 mSDtfsCounter, 846 mSDsluCounter, 978 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 2808 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:58:02,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 2808 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:58:02,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24967 states. [2025-01-09 04:58:02,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24967 to 12969. [2025-01-09 04:58:02,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12969 states, 12968 states have (on average 1.589990746452807) internal successors, (20619), 12968 states have internal predecessors, (20619), 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:58:02,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12969 states to 12969 states and 20619 transitions. [2025-01-09 04:58:02,973 INFO L78 Accepts]: Start accepts. Automaton has 12969 states and 20619 transitions. Word has length 252 [2025-01-09 04:58:02,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:02,974 INFO L471 AbstractCegarLoop]: Abstraction has 12969 states and 20619 transitions. [2025-01-09 04:58:02,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:02,974 INFO L276 IsEmpty]: Start isEmpty. Operand 12969 states and 20619 transitions. [2025-01-09 04:58:02,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-01-09 04:58:02,983 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:02,983 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:58:02,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:58:02,984 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:02,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:02,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1308196023, now seen corresponding path program 1 times [2025-01-09 04:58:02,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:02,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371388623] [2025-01-09 04:58:02,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:02,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:03,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-01-09 04:58:03,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-01-09 04:58:03,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:03,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:03,633 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:58:03,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:03,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371388623] [2025-01-09 04:58:03,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371388623] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:03,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:03,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:58:03,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738452895] [2025-01-09 04:58:03,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:03,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:58:03,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:03,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:58:03,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:58:03,635 INFO L87 Difference]: Start difference. First operand 12969 states and 20619 transitions. Second operand has 9 states, 9 states have (on average 28.11111111111111) internal successors, (253), 8 states have internal predecessors, (253), 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:58:04,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:04,804 INFO L93 Difference]: Finished difference Result 55171 states and 88805 transitions. [2025-01-09 04:58:04,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:58:04,805 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 28.11111111111111) internal successors, (253), 8 states have internal predecessors, (253), 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 253 [2025-01-09 04:58:04,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:04,881 INFO L225 Difference]: With dead ends: 55171 [2025-01-09 04:58:04,881 INFO L226 Difference]: Without dead ends: 44193 [2025-01-09 04:58:04,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:58:04,911 INFO L435 NwaCegarLoop]: 808 mSDtfsCounter, 7422 mSDsluCounter, 4419 mSDsCounter, 0 mSdLazyCounter, 1328 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7422 SdHoareTripleChecker+Valid, 5227 SdHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 04:58:04,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7422 Valid, 5227 Invalid, 1403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1328 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 04:58:04,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44193 states. [2025-01-09 04:58:05,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44193 to 29479. [2025-01-09 04:58:05,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29479 states, 29478 states have (on average 1.5802971707714228) internal successors, (46584), 29478 states have internal predecessors, (46584), 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:58:05,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29479 states to 29479 states and 46584 transitions. [2025-01-09 04:58:05,470 INFO L78 Accepts]: Start accepts. Automaton has 29479 states and 46584 transitions. Word has length 253 [2025-01-09 04:58:05,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:05,471 INFO L471 AbstractCegarLoop]: Abstraction has 29479 states and 46584 transitions. [2025-01-09 04:58:05,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.11111111111111) internal successors, (253), 8 states have internal predecessors, (253), 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:58:05,472 INFO L276 IsEmpty]: Start isEmpty. Operand 29479 states and 46584 transitions. [2025-01-09 04:58:05,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-01-09 04:58:05,485 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:05,485 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:58:05,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:58:05,486 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:05,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:05,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1675051840, now seen corresponding path program 1 times [2025-01-09 04:58:05,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:05,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440598987] [2025-01-09 04:58:05,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:05,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:05,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-01-09 04:58:05,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-01-09 04:58:05,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:05,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:06,099 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:58:06,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:06,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440598987] [2025-01-09 04:58:06,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440598987] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:06,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:06,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:58:06,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716620282] [2025-01-09 04:58:06,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:06,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:58:06,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:06,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:58:06,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:58:06,102 INFO L87 Difference]: Start difference. First operand 29479 states and 46584 transitions. Second operand has 4 states, 4 states have (on average 63.25) internal successors, (253), 4 states have internal predecessors, (253), 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:58:06,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:06,441 INFO L93 Difference]: Finished difference Result 114853 states and 181439 transitions. [2025-01-09 04:58:06,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:58:06,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.25) internal successors, (253), 4 states have internal predecessors, (253), 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 253 [2025-01-09 04:58:06,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:06,565 INFO L225 Difference]: With dead ends: 114853 [2025-01-09 04:58:06,566 INFO L226 Difference]: Without dead ends: 85573 [2025-01-09 04:58:06,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:58:06,616 INFO L435 NwaCegarLoop]: 1623 mSDtfsCounter, 1797 mSDsluCounter, 1855 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1797 SdHoareTripleChecker+Valid, 3478 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:58:06,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1797 Valid, 3478 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:58:06,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85573 states. [2025-01-09 04:58:07,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85573 to 57545. [2025-01-09 04:58:07,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57545 states, 57544 states have (on average 1.5724489086611984) internal successors, (90485), 57544 states have internal predecessors, (90485), 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:58:07,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57545 states to 57545 states and 90485 transitions. [2025-01-09 04:58:07,754 INFO L78 Accepts]: Start accepts. Automaton has 57545 states and 90485 transitions. Word has length 253 [2025-01-09 04:58:07,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:07,755 INFO L471 AbstractCegarLoop]: Abstraction has 57545 states and 90485 transitions. [2025-01-09 04:58:07,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.25) internal successors, (253), 4 states have internal predecessors, (253), 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:58:07,755 INFO L276 IsEmpty]: Start isEmpty. Operand 57545 states and 90485 transitions. [2025-01-09 04:58:07,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-01-09 04:58:07,776 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:07,776 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:58:07,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:58:07,777 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:07,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:07,777 INFO L85 PathProgramCache]: Analyzing trace with hash 2093143055, now seen corresponding path program 1 times [2025-01-09 04:58:07,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:07,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341806880] [2025-01-09 04:58:07,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:07,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:07,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-01-09 04:58:07,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-01-09 04:58:07,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:07,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:07,884 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:58:07,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:07,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341806880] [2025-01-09 04:58:07,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341806880] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:07,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:07,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:58:07,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636576352] [2025-01-09 04:58:07,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:07,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:58:07,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:07,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:58:07,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:58:07,885 INFO L87 Difference]: Start difference. First operand 57545 states and 90485 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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:58:08,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:08,315 INFO L93 Difference]: Finished difference Result 168516 states and 264863 transitions. [2025-01-09 04:58:08,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:58:08,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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 255 [2025-01-09 04:58:08,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:08,472 INFO L225 Difference]: With dead ends: 168516 [2025-01-09 04:58:08,472 INFO L226 Difference]: Without dead ends: 112425 [2025-01-09 04:58:08,535 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:58:08,535 INFO L435 NwaCegarLoop]: 1816 mSDtfsCounter, 834 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 2752 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:58:08,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [834 Valid, 2752 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:58:08,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112425 states. [2025-01-09 04:58:10,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112425 to 112423. [2025-01-09 04:58:10,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112423 states, 112422 states have (on average 1.5666862357901479) internal successors, (176130), 112422 states have internal predecessors, (176130), 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:58:10,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112423 states to 112423 states and 176130 transitions. [2025-01-09 04:58:10,792 INFO L78 Accepts]: Start accepts. Automaton has 112423 states and 176130 transitions. Word has length 255 [2025-01-09 04:58:10,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:10,792 INFO L471 AbstractCegarLoop]: Abstraction has 112423 states and 176130 transitions. [2025-01-09 04:58:10,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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:58:10,792 INFO L276 IsEmpty]: Start isEmpty. Operand 112423 states and 176130 transitions. [2025-01-09 04:58:10,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-01-09 04:58:10,823 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:10,823 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:58:10,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:58:10,823 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:10,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:10,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1467719302, now seen corresponding path program 1 times [2025-01-09 04:58:10,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:10,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810579322] [2025-01-09 04:58:10,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:10,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:10,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-01-09 04:58:10,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-01-09 04:58:10,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:10,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:11,008 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:58:11,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:11,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810579322] [2025-01-09 04:58:11,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810579322] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:11,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:11,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:58:11,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416496614] [2025-01-09 04:58:11,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:11,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:58:11,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:11,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:58:11,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:58:11,010 INFO L87 Difference]: Start difference. First operand 112423 states and 176130 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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:58:11,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:11,541 INFO L93 Difference]: Finished difference Result 222753 states and 348690 transitions. [2025-01-09 04:58:11,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:58:11,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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 255 [2025-01-09 04:58:11,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:11,722 INFO L225 Difference]: With dead ends: 222753 [2025-01-09 04:58:11,722 INFO L226 Difference]: Without dead ends: 112909 [2025-01-09 04:58:11,829 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:58:11,830 INFO L435 NwaCegarLoop]: 993 mSDtfsCounter, 5 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1970 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:58:11,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1970 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:58:11,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112909 states. [2025-01-09 04:58:13,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112909 to 112909. [2025-01-09 04:58:13,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112909 states, 112908 states have (on average 1.5648404010344705) internal successors, (176683), 112908 states have internal predecessors, (176683), 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:58:13,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112909 states to 112909 states and 176683 transitions. [2025-01-09 04:58:13,590 INFO L78 Accepts]: Start accepts. Automaton has 112909 states and 176683 transitions. Word has length 255 [2025-01-09 04:58:13,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:13,590 INFO L471 AbstractCegarLoop]: Abstraction has 112909 states and 176683 transitions. [2025-01-09 04:58:13,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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:58:13,590 INFO L276 IsEmpty]: Start isEmpty. Operand 112909 states and 176683 transitions. [2025-01-09 04:58:13,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-01-09 04:58:13,651 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:13,651 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:58:13,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:58:13,652 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:13,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:13,652 INFO L85 PathProgramCache]: Analyzing trace with hash -469766314, now seen corresponding path program 1 times [2025-01-09 04:58:13,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:13,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999032636] [2025-01-09 04:58:13,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:13,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:13,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-01-09 04:58:13,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-01-09 04:58:13,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:13,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:14,564 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:58:14,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:14,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999032636] [2025-01-09 04:58:14,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999032636] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:14,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:14,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:58:14,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562988634] [2025-01-09 04:58:14,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:14,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:58:14,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:14,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:58:14,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:58:14,566 INFO L87 Difference]: Start difference. First operand 112909 states and 176683 transitions. Second operand has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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:58:15,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:15,214 INFO L93 Difference]: Finished difference Result 217419 states and 340135 transitions. [2025-01-09 04:58:15,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:58:15,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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 256 [2025-01-09 04:58:15,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:15,367 INFO L225 Difference]: With dead ends: 217419 [2025-01-09 04:58:15,367 INFO L226 Difference]: Without dead ends: 106951 [2025-01-09 04:58:15,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:58:15,438 INFO L435 NwaCegarLoop]: 1120 mSDtfsCounter, 99 mSDsluCounter, 2095 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 3215 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:58:15,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 3215 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:58:15,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106951 states. [2025-01-09 04:58:16,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106951 to 106875. [2025-01-09 04:58:16,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106875 states, 106874 states have (on average 1.5656193274323034) internal successors, (167324), 106874 states have internal predecessors, (167324), 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:58:16,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106875 states to 106875 states and 167324 transitions. [2025-01-09 04:58:16,819 INFO L78 Accepts]: Start accepts. Automaton has 106875 states and 167324 transitions. Word has length 256 [2025-01-09 04:58:16,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:16,820 INFO L471 AbstractCegarLoop]: Abstraction has 106875 states and 167324 transitions. [2025-01-09 04:58:16,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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:58:16,820 INFO L276 IsEmpty]: Start isEmpty. Operand 106875 states and 167324 transitions. [2025-01-09 04:58:16,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-01-09 04:58:16,850 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:16,851 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:58:16,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:58:16,851 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:16,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:16,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1025592873, now seen corresponding path program 1 times [2025-01-09 04:58:16,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:16,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750372728] [2025-01-09 04:58:16,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:16,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:16,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-01-09 04:58:16,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-01-09 04:58:16,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:16,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:16,941 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:58:16,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:16,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750372728] [2025-01-09 04:58:16,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750372728] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:16,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:16,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:58:16,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739926534] [2025-01-09 04:58:16,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:16,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:58:16,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:16,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:58:16,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:58:16,944 INFO L87 Difference]: Start difference. First operand 106875 states and 167324 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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:58:17,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:17,991 INFO L93 Difference]: Finished difference Result 279575 states and 442138 transitions. [2025-01-09 04:58:17,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:58:17,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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 256 [2025-01-09 04:58:17,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:18,254 INFO L225 Difference]: With dead ends: 279575 [2025-01-09 04:58:18,254 INFO L226 Difference]: Without dead ends: 180053 [2025-01-09 04:58:18,357 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:58:18,357 INFO L435 NwaCegarLoop]: 1273 mSDtfsCounter, 499 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 2006 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:58:18,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 2006 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:58:18,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180053 states. [2025-01-09 04:58:20,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180053 to 167867. [2025-01-09 04:58:20,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167867 states, 167866 states have (on average 1.575280283082935) internal successors, (264436), 167866 states have internal predecessors, (264436), 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:58:21,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167867 states to 167867 states and 264436 transitions. [2025-01-09 04:58:21,087 INFO L78 Accepts]: Start accepts. Automaton has 167867 states and 264436 transitions. Word has length 256 [2025-01-09 04:58:21,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:21,088 INFO L471 AbstractCegarLoop]: Abstraction has 167867 states and 264436 transitions. [2025-01-09 04:58:21,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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:58:21,088 INFO L276 IsEmpty]: Start isEmpty. Operand 167867 states and 264436 transitions. [2025-01-09 04:58:21,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-01-09 04:58:21,118 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:21,118 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:58:21,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:58:21,118 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:21,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:21,119 INFO L85 PathProgramCache]: Analyzing trace with hash -218575916, now seen corresponding path program 1 times [2025-01-09 04:58:21,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:21,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817014898] [2025-01-09 04:58:21,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:21,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:21,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-01-09 04:58:21,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-01-09 04:58:21,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:21,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:21,225 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:58:21,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:21,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817014898] [2025-01-09 04:58:21,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817014898] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:21,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:21,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:58:21,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524153362] [2025-01-09 04:58:21,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:21,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:58:21,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:21,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:58:21,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:58:21,227 INFO L87 Difference]: Start difference. First operand 167867 states and 264436 transitions. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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:58:23,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:23,856 INFO L93 Difference]: Finished difference Result 496449 states and 781905 transitions. [2025-01-09 04:58:23,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:58:23,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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 257 [2025-01-09 04:58:23,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:24,398 INFO L225 Difference]: With dead ends: 496449 [2025-01-09 04:58:24,398 INFO L226 Difference]: Without dead ends: 329465 [2025-01-09 04:58:24,486 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:58:24,487 INFO L435 NwaCegarLoop]: 1857 mSDtfsCounter, 817 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 2786 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:58:24,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 2786 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:58:24,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329465 states. [2025-01-09 04:58:28,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329465 to 329463. [2025-01-09 04:58:29,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329463 states, 329462 states have (on average 1.5669849633645154) internal successors, (516262), 329462 states have internal predecessors, (516262), 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:58:29,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329463 states to 329463 states and 516262 transitions. [2025-01-09 04:58:29,864 INFO L78 Accepts]: Start accepts. Automaton has 329463 states and 516262 transitions. Word has length 257 [2025-01-09 04:58:29,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:29,864 INFO L471 AbstractCegarLoop]: Abstraction has 329463 states and 516262 transitions. [2025-01-09 04:58:29,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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:58:29,865 INFO L276 IsEmpty]: Start isEmpty. Operand 329463 states and 516262 transitions. [2025-01-09 04:58:29,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-01-09 04:58:29,916 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:29,916 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:58:29,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:58:29,916 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:29,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:29,917 INFO L85 PathProgramCache]: Analyzing trace with hash -559407401, now seen corresponding path program 1 times [2025-01-09 04:58:29,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:29,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158710831] [2025-01-09 04:58:29,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:29,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:29,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-01-09 04:58:30,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-01-09 04:58:30,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:30,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:30,686 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:58:30,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:30,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158710831] [2025-01-09 04:58:30,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158710831] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:30,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:30,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:58:30,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186144719] [2025-01-09 04:58:30,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:30,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:58:30,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:30,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:58:30,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:58:30,688 INFO L87 Difference]: Start difference. First operand 329463 states and 516262 transitions. Second operand has 5 states, 5 states have (on average 51.4) internal successors, (257), 5 states have internal predecessors, (257), 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:58:33,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:33,616 INFO L93 Difference]: Finished difference Result 949189 states and 1485987 transitions. [2025-01-09 04:58:33,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:58:33,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 51.4) internal successors, (257), 5 states have internal predecessors, (257), 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 257 [2025-01-09 04:58:33,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:35,300 INFO L225 Difference]: With dead ends: 949189 [2025-01-09 04:58:35,300 INFO L226 Difference]: Without dead ends: 619941 [2025-01-09 04:58:35,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:58:35,487 INFO L435 NwaCegarLoop]: 1584 mSDtfsCounter, 857 mSDsluCounter, 2474 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 4058 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:58:35,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 4058 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:58:35,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619941 states.