./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.3.ufo.UNBOUNDED.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.3.ufo.UNBOUNDED.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 762d765a0bfa38e2766b0b76686f2c77e8bd37a42ad4f655f125678c5ab317c3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:58:22,567 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:58:22,625 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:58:22,629 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:58:22,633 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:58:22,659 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:58:22,660 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:58:22,660 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:58:22,660 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:58:22,660 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:58:22,660 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:58:22,661 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:58:22,661 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:58:22,661 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:58:22,661 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:58:22,661 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:58:22,661 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:58:22,661 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:58:22,661 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:58:22,661 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:58:22,661 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:58:22,661 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:58:22,661 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:58:22,661 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:58:22,661 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:58:22,661 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:58:22,662 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:58:22,662 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:58:22,662 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:58:22,662 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:58:22,662 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:58:22,662 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:58:22,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:58:22,662 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:58:22,662 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:58:22,662 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:58:22,662 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:58:22,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:58:22,662 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:58:22,662 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:58:22,662 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:58:22,662 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:58:22,662 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:58:22,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:58:22,662 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:58:22,663 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:58:22,663 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:58:22,663 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:58:22,663 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 -> 762d765a0bfa38e2766b0b76686f2c77e8bd37a42ad4f655f125678c5ab317c3 [2025-01-09 04:58:22,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:58:22,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:58:22,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:58:22,944 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:58:22,944 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:58:22,945 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.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-01-09 04:58:24,145 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/54600247d/919b61e2496649779fd219f90ae96e1d/FLAGd6717497a [2025-01-09 04:58:24,502 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:58:24,503 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-01-09 04:58:24,527 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/54600247d/919b61e2496649779fd219f90ae96e1d/FLAGd6717497a [2025-01-09 04:58:24,541 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/54600247d/919b61e2496649779fd219f90ae96e1d [2025-01-09 04:58:24,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:58:24,545 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:58:24,547 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:58:24,547 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:58:24,550 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:58:24,552 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:58:24" (1/1) ... [2025-01-09 04:58:24,553 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@317e1612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:58:24, skipping insertion in model container [2025-01-09 04:58:24,553 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:58:24" (1/1) ... [2025-01-09 04:58:24,615 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:58:24,994 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.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[35193,35206] [2025-01-09 04:58:25,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:58:25,112 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:58:25,291 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.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[35193,35206] [2025-01-09 04:58:25,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:58:25,388 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:58:25,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:58:25 WrapperNode [2025-01-09 04:58:25,391 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:58:25,392 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:58:25,392 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:58:25,392 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:58:25,397 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:58:25" (1/1) ... [2025-01-09 04:58:25,423 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:58:25" (1/1) ... [2025-01-09 04:58:25,528 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3096 [2025-01-09 04:58:25,528 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:58:25,529 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:58:25,529 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:58:25,529 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:58:25,537 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:58:25" (1/1) ... [2025-01-09 04:58:25,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:58:25" (1/1) ... [2025-01-09 04:58:25,550 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:58:25" (1/1) ... [2025-01-09 04:58:25,598 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:58:25,598 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:58:25" (1/1) ... [2025-01-09 04:58:25,598 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:58:25" (1/1) ... [2025-01-09 04:58:25,637 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:58:25" (1/1) ... [2025-01-09 04:58:25,644 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:58:25" (1/1) ... [2025-01-09 04:58:25,668 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:58:25" (1/1) ... [2025-01-09 04:58:25,680 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:58:25" (1/1) ... [2025-01-09 04:58:25,692 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:58:25" (1/1) ... [2025-01-09 04:58:25,711 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:58:25,713 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:58:25,713 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:58:25,713 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:58:25,715 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:58:25" (1/1) ... [2025-01-09 04:58:25,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:58:25,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:58:25,749 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:58:25,758 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:58:25,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:58:25,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:58:25,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:58:25,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:58:25,945 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:58:25,947 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:58:27,842 INFO L? ?]: Removed 209 outVars from TransFormulas that were not future-live. [2025-01-09 04:58:27,843 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:58:27,877 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:58:27,877 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:58:27,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:58:27 BoogieIcfgContainer [2025-01-09 04:58:27,877 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:58:27,879 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:58:27,879 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:58:27,886 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:58:27,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:58:24" (1/3) ... [2025-01-09 04:58:27,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75cf1a9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:58:27, skipping insertion in model container [2025-01-09 04:58:27,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:58:25" (2/3) ... [2025-01-09 04:58:27,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75cf1a9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:58:27, skipping insertion in model container [2025-01-09 04:58:27,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:58:27" (3/3) ... [2025-01-09 04:58:27,888 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-01-09 04:58:27,905 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:58:27,908 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c that has 1 procedures, 803 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 04:58:27,974 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:58:27,984 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;@2326706f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:58:27,984 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:58:27,993 INFO L276 IsEmpty]: Start isEmpty. Operand has 803 states, 801 states have (on average 1.7815230961298376) internal successors, (1427), 802 states have internal predecessors, (1427), 0 states have call successors, (0), 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:28,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-01-09 04:58:28,012 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:28,013 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,013 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:28,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:28,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1895719391, now seen corresponding path program 1 times [2025-01-09 04:58:28,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:28,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423683192] [2025-01-09 04:58:28,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:28,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:28,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-01-09 04:58:28,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-01-09 04:58:28,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:28,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:28,986 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:28,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:28,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423683192] [2025-01-09 04:58:28,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423683192] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:28,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:28,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:58:28,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850197312] [2025-01-09 04:58:28,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:29,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:58:29,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:29,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:58:29,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:58:29,037 INFO L87 Difference]: Start difference. First operand has 803 states, 801 states have (on average 1.7815230961298376) internal successors, (1427), 802 states have internal predecessors, (1427), 0 states have call successors, (0), 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 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:29,245 INFO L93 Difference]: Finished difference Result 1520 states and 2676 transitions. [2025-01-09 04:58:29,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:58:29,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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 326 [2025-01-09 04:58:29,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:29,270 INFO L225 Difference]: With dead ends: 1520 [2025-01-09 04:58:29,270 INFO L226 Difference]: Without dead ends: 1307 [2025-01-09 04:58:29,273 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:29,279 INFO L435 NwaCegarLoop]: 1366 mSDtfsCounter, 877 mSDsluCounter, 1149 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 2515 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:58:29,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [877 Valid, 2515 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:58:29,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307 states. [2025-01-09 04:58:29,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307 to 1305. [2025-01-09 04:58:29,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1305 states, 1304 states have (on average 1.5613496932515338) internal successors, (2036), 1304 states have internal predecessors, (2036), 0 states have call successors, (0), 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,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 2036 transitions. [2025-01-09 04:58:29,402 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 2036 transitions. Word has length 326 [2025-01-09 04:58:29,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:29,403 INFO L471 AbstractCegarLoop]: Abstraction has 1305 states and 2036 transitions. [2025-01-09 04:58:29,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 2036 transitions. [2025-01-09 04:58:29,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-01-09 04:58:29,410 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:29,410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:58:29,411 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:29,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:29,412 INFO L85 PathProgramCache]: Analyzing trace with hash -838090867, now seen corresponding path program 1 times [2025-01-09 04:58:29,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:29,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006732776] [2025-01-09 04:58:29,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:29,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:29,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-01-09 04:58:29,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-01-09 04:58:29,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:29,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:29,775 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:29,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:29,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006732776] [2025-01-09 04:58:29,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006732776] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:29,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:29,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:58:29,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561341461] [2025-01-09 04:58:29,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:29,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:58:29,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:29,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:58:29,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:58:29,777 INFO L87 Difference]: Start difference. First operand 1305 states and 2036 transitions. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:29,932 INFO L93 Difference]: Finished difference Result 2635 states and 4139 transitions. [2025-01-09 04:58:29,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:58:29,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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 326 [2025-01-09 04:58:29,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:29,942 INFO L225 Difference]: With dead ends: 2635 [2025-01-09 04:58:29,943 INFO L226 Difference]: Without dead ends: 2277 [2025-01-09 04:58:29,945 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:29,947 INFO L435 NwaCegarLoop]: 1189 mSDtfsCounter, 711 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 2180 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:58:29,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 2180 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:58:29,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2277 states. [2025-01-09 04:58:29,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2277 to 2275. [2025-01-09 04:58:29,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2275 states, 2274 states have (on average 1.5567282321899736) internal successors, (3540), 2274 states have internal predecessors, (3540), 0 states have call successors, (0), 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:30,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2275 states to 2275 states and 3540 transitions. [2025-01-09 04:58:30,008 INFO L78 Accepts]: Start accepts. Automaton has 2275 states and 3540 transitions. Word has length 326 [2025-01-09 04:58:30,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:30,010 INFO L471 AbstractCegarLoop]: Abstraction has 2275 states and 3540 transitions. [2025-01-09 04:58:30,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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:30,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2275 states and 3540 transitions. [2025-01-09 04:58:30,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-01-09 04:58:30,015 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:30,016 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:58:30,016 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:30,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:30,017 INFO L85 PathProgramCache]: Analyzing trace with hash -610935221, now seen corresponding path program 1 times [2025-01-09 04:58:30,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:30,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018157687] [2025-01-09 04:58:30,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:30,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:30,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-01-09 04:58:30,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-01-09 04:58:30,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:30,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:30,391 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,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:30,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018157687] [2025-01-09 04:58:30,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018157687] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:30,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:30,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:58:30,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37310993] [2025-01-09 04:58:30,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:30,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:58:30,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:30,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:58:30,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:58:30,394 INFO L87 Difference]: Start difference. First operand 2275 states and 3540 transitions. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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:30,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:30,534 INFO L93 Difference]: Finished difference Result 4843 states and 7598 transitions. [2025-01-09 04:58:30,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:58:30,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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 326 [2025-01-09 04:58:30,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:30,549 INFO L225 Difference]: With dead ends: 4843 [2025-01-09 04:58:30,549 INFO L226 Difference]: Without dead ends: 4177 [2025-01-09 04:58:30,551 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:30,552 INFO L435 NwaCegarLoop]: 1189 mSDtfsCounter, 702 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 2165 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:58:30,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 2165 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:58:30,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4177 states. [2025-01-09 04:58:30,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4177 to 4175. [2025-01-09 04:58:30,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4175 states, 4174 states have (on average 1.552467656923814) internal successors, (6480), 4174 states have internal predecessors, (6480), 0 states have call successors, (0), 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:30,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4175 states to 4175 states and 6480 transitions. [2025-01-09 04:58:30,626 INFO L78 Accepts]: Start accepts. Automaton has 4175 states and 6480 transitions. Word has length 326 [2025-01-09 04:58:30,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:30,627 INFO L471 AbstractCegarLoop]: Abstraction has 4175 states and 6480 transitions. [2025-01-09 04:58:30,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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:30,627 INFO L276 IsEmpty]: Start isEmpty. Operand 4175 states and 6480 transitions. [2025-01-09 04:58:30,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-01-09 04:58:30,633 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:30,634 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:58:30,634 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:30,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:30,635 INFO L85 PathProgramCache]: Analyzing trace with hash 621643781, now seen corresponding path program 1 times [2025-01-09 04:58:30,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:30,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166543327] [2025-01-09 04:58:30,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:30,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:30,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-01-09 04:58:31,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-01-09 04:58:31,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:31,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:31,631 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:31,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:31,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166543327] [2025-01-09 04:58:31,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166543327] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:31,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:31,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:58:31,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905299535] [2025-01-09 04:58:31,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:31,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:58:31,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:31,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:58:31,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:58:31,634 INFO L87 Difference]: Start difference. First operand 4175 states and 6480 transitions. Second operand has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 0 states have call successors, (0), 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:31,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:31,813 INFO L93 Difference]: Finished difference Result 16323 states and 25281 transitions. [2025-01-09 04:58:31,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:58:31,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 0 states have call successors, (0), 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 326 [2025-01-09 04:58:31,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:31,852 INFO L225 Difference]: With dead ends: 16323 [2025-01-09 04:58:31,853 INFO L226 Difference]: Without dead ends: 12195 [2025-01-09 04:58:31,868 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:31,871 INFO L435 NwaCegarLoop]: 1899 mSDtfsCounter, 2311 mSDsluCounter, 2332 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2311 SdHoareTripleChecker+Valid, 4231 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:58:31,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2311 Valid, 4231 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:58:31,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12195 states. [2025-01-09 04:58:32,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12195 to 8188. [2025-01-09 04:58:32,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8188 states, 8187 states have (on average 1.5434224990839136) internal successors, (12636), 8187 states have internal predecessors, (12636), 0 states have call successors, (0), 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:32,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8188 states to 8188 states and 12636 transitions. [2025-01-09 04:58:32,144 INFO L78 Accepts]: Start accepts. Automaton has 8188 states and 12636 transitions. Word has length 326 [2025-01-09 04:58:32,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:32,144 INFO L471 AbstractCegarLoop]: Abstraction has 8188 states and 12636 transitions. [2025-01-09 04:58:32,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 0 states have call successors, (0), 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:32,145 INFO L276 IsEmpty]: Start isEmpty. Operand 8188 states and 12636 transitions. [2025-01-09 04:58:32,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-01-09 04:58:32,158 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:32,158 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:58:32,159 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:32,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:32,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1177259334, now seen corresponding path program 1 times [2025-01-09 04:58:32,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:32,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274154997] [2025-01-09 04:58:32,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:32,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:32,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-01-09 04:58:32,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-01-09 04:58:32,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:32,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:32,323 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:32,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:32,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274154997] [2025-01-09 04:58:32,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274154997] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:32,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:32,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:58:32,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226906303] [2025-01-09 04:58:32,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:32,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:58:32,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:32,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:58:32,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:58:32,326 INFO L87 Difference]: Start difference. First operand 8188 states and 12636 transitions. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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:32,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:32,492 INFO L93 Difference]: Finished difference Result 24127 states and 37161 transitions. [2025-01-09 04:58:32,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:58:32,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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 328 [2025-01-09 04:58:32,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:32,535 INFO L225 Difference]: With dead ends: 24127 [2025-01-09 04:58:32,536 INFO L226 Difference]: Without dead ends: 16064 [2025-01-09 04:58:32,553 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:32,554 INFO L435 NwaCegarLoop]: 2423 mSDtfsCounter, 1108 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1108 SdHoareTripleChecker+Valid, 3608 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:58:32,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1108 Valid, 3608 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:58:32,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16064 states. [2025-01-09 04:58:32,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16064 to 16062. [2025-01-09 04:58:32,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16062 states, 16061 states have (on average 1.5342755743727041) internal successors, (24642), 16061 states have internal predecessors, (24642), 0 states have call successors, (0), 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:32,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16062 states to 16062 states and 24642 transitions. [2025-01-09 04:58:32,937 INFO L78 Accepts]: Start accepts. Automaton has 16062 states and 24642 transitions. Word has length 328 [2025-01-09 04:58:32,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:32,937 INFO L471 AbstractCegarLoop]: Abstraction has 16062 states and 24642 transitions. [2025-01-09 04:58:32,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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:32,938 INFO L276 IsEmpty]: Start isEmpty. Operand 16062 states and 24642 transitions. [2025-01-09 04:58:32,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-01-09 04:58:32,956 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:32,956 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:58:32,957 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:32,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:32,957 INFO L85 PathProgramCache]: Analyzing trace with hash -2057091457, now seen corresponding path program 1 times [2025-01-09 04:58:32,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:32,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167089594] [2025-01-09 04:58:32,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:32,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:32,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-01-09 04:58:32,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-01-09 04:58:32,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:32,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:33,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:58:33,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:33,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167089594] [2025-01-09 04:58:33,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167089594] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:33,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:33,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:58:33,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927426404] [2025-01-09 04:58:33,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:33,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:58:33,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:33,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:58:33,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:58:33,084 INFO L87 Difference]: Start difference. First operand 16062 states and 24642 transitions. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:33,289 INFO L93 Difference]: Finished difference Result 48119 states and 73805 transitions. [2025-01-09 04:58:33,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:58:33,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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 328 [2025-01-09 04:58:33,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:33,342 INFO L225 Difference]: With dead ends: 48119 [2025-01-09 04:58:33,343 INFO L226 Difference]: Without dead ends: 32095 [2025-01-09 04:58:33,362 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:33,363 INFO L435 NwaCegarLoop]: 2476 mSDtfsCounter, 1235 mSDsluCounter, 1236 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 3712 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:58:33,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1235 Valid, 3712 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:58:33,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32095 states. [2025-01-09 04:58:33,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32095 to 16081. [2025-01-09 04:58:33,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16081 states, 16080 states have (on average 1.5342661691542288) internal successors, (24671), 16080 states have internal predecessors, (24671), 0 states have call successors, (0), 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,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16081 states to 16081 states and 24671 transitions. [2025-01-09 04:58:33,828 INFO L78 Accepts]: Start accepts. Automaton has 16081 states and 24671 transitions. Word has length 328 [2025-01-09 04:58:33,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:33,829 INFO L471 AbstractCegarLoop]: Abstraction has 16081 states and 24671 transitions. [2025-01-09 04:58:33,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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,830 INFO L276 IsEmpty]: Start isEmpty. Operand 16081 states and 24671 transitions. [2025-01-09 04:58:33,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-01-09 04:58:33,853 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:33,853 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:58:33,853 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:33,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:33,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1095378133, now seen corresponding path program 1 times [2025-01-09 04:58:33,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:33,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548096287] [2025-01-09 04:58:33,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:33,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:33,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-01-09 04:58:33,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-01-09 04:58:33,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:33,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:34,016 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:34,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:34,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548096287] [2025-01-09 04:58:34,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548096287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:34,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:34,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:58:34,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889213235] [2025-01-09 04:58:34,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:34,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:58:34,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:34,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:58:34,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:58:34,021 INFO L87 Difference]: Start difference. First operand 16081 states and 24671 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:34,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:34,140 INFO L93 Difference]: Finished difference Result 32124 states and 49272 transitions. [2025-01-09 04:58:34,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:58:34,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 329 [2025-01-09 04:58:34,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:34,172 INFO L225 Difference]: With dead ends: 32124 [2025-01-09 04:58:34,173 INFO L226 Difference]: Without dead ends: 16099 [2025-01-09 04:58:34,195 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:34,196 INFO L435 NwaCegarLoop]: 1259 mSDtfsCounter, 5 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2503 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:58:34,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2503 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:58:34,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16099 states. [2025-01-09 04:58:34,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16099 to 16099. [2025-01-09 04:58:34,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16099 states, 16098 states have (on average 1.5338551372841347) internal successors, (24692), 16098 states have internal predecessors, (24692), 0 states have call successors, (0), 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:34,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16099 states to 16099 states and 24692 transitions. [2025-01-09 04:58:34,492 INFO L78 Accepts]: Start accepts. Automaton has 16099 states and 24692 transitions. Word has length 329 [2025-01-09 04:58:34,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:34,492 INFO L471 AbstractCegarLoop]: Abstraction has 16099 states and 24692 transitions. [2025-01-09 04:58:34,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:34,492 INFO L276 IsEmpty]: Start isEmpty. Operand 16099 states and 24692 transitions. [2025-01-09 04:58:34,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2025-01-09 04:58:34,513 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:34,514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:58:34,514 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:34,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:34,515 INFO L85 PathProgramCache]: Analyzing trace with hash -174338763, now seen corresponding path program 1 times [2025-01-09 04:58:34,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:34,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087371729] [2025-01-09 04:58:34,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:34,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:34,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-01-09 04:58:34,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-01-09 04:58:34,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:34,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:34,680 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:34,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:34,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087371729] [2025-01-09 04:58:34,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087371729] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:34,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:34,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:58:34,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289511073] [2025-01-09 04:58:34,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:34,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:58:34,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:34,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:58:34,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:58:34,682 INFO L87 Difference]: Start difference. First operand 16099 states and 24692 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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:34,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:34,911 INFO L93 Difference]: Finished difference Result 47338 states and 72454 transitions. [2025-01-09 04:58:34,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:58:34,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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 330 [2025-01-09 04:58:34,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:34,960 INFO L225 Difference]: With dead ends: 47338 [2025-01-09 04:58:34,961 INFO L226 Difference]: Without dead ends: 31480 [2025-01-09 04:58:34,985 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:34,986 INFO L435 NwaCegarLoop]: 2428 mSDtfsCounter, 1102 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1102 SdHoareTripleChecker+Valid, 3613 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:58:34,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1102 Valid, 3613 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:58:35,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31480 states. [2025-01-09 04:58:35,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31480 to 31478. [2025-01-09 04:58:35,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31478 states, 31477 states have (on average 1.5238110366299202) internal successors, (47965), 31477 states have internal predecessors, (47965), 0 states have call successors, (0), 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:35,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31478 states to 31478 states and 47965 transitions. [2025-01-09 04:58:35,387 INFO L78 Accepts]: Start accepts. Automaton has 31478 states and 47965 transitions. Word has length 330 [2025-01-09 04:58:35,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:35,388 INFO L471 AbstractCegarLoop]: Abstraction has 31478 states and 47965 transitions. [2025-01-09 04:58:35,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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:35,388 INFO L276 IsEmpty]: Start isEmpty. Operand 31478 states and 47965 transitions. [2025-01-09 04:58:35,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2025-01-09 04:58:35,420 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:35,420 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:58:35,420 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:35,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:35,421 INFO L85 PathProgramCache]: Analyzing trace with hash 2022187602, now seen corresponding path program 1 times [2025-01-09 04:58:35,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:35,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851220767] [2025-01-09 04:58:35,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:35,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:35,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-01-09 04:58:35,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-01-09 04:58:35,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:35,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:36,062 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:36,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:36,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851220767] [2025-01-09 04:58:36,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851220767] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:36,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:36,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:58:36,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065396033] [2025-01-09 04:58:36,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:36,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:58:36,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:36,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:58:36,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:58:36,064 INFO L87 Difference]: Start difference. First operand 31478 states and 47965 transitions. Second operand has 4 states, 4 states have (on average 82.5) internal successors, (330), 4 states have internal predecessors, (330), 0 states have call successors, (0), 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:36,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:36,495 INFO L93 Difference]: Finished difference Result 122802 states and 186627 transitions. [2025-01-09 04:58:36,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:58:36,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.5) internal successors, (330), 4 states have internal predecessors, (330), 0 states have call successors, (0), 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 330 [2025-01-09 04:58:36,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:36,640 INFO L225 Difference]: With dead ends: 122802 [2025-01-09 04:58:36,641 INFO L226 Difference]: Without dead ends: 91500 [2025-01-09 04:58:36,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:36,683 INFO L435 NwaCegarLoop]: 2417 mSDtfsCounter, 2315 mSDsluCounter, 2795 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2315 SdHoareTripleChecker+Valid, 5212 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:58:36,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2315 Valid, 5212 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:58:36,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91500 states. [2025-01-09 04:58:37,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91500 to 61508. [2025-01-09 04:58:37,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61508 states, 61507 states have (on average 1.5129172289332922) internal successors, (93055), 61507 states have internal predecessors, (93055), 0 states have call successors, (0), 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:37,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61508 states to 61508 states and 93055 transitions. [2025-01-09 04:58:37,925 INFO L78 Accepts]: Start accepts. Automaton has 61508 states and 93055 transitions. Word has length 330 [2025-01-09 04:58:37,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:37,925 INFO L471 AbstractCegarLoop]: Abstraction has 61508 states and 93055 transitions. [2025-01-09 04:58:37,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.5) internal successors, (330), 4 states have internal predecessors, (330), 0 states have call successors, (0), 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:37,925 INFO L276 IsEmpty]: Start isEmpty. Operand 61508 states and 93055 transitions. [2025-01-09 04:58:37,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-01-09 04:58:37,986 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:37,987 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:58:37,987 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:37,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:37,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1558694314, now seen corresponding path program 1 times [2025-01-09 04:58:37,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:37,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770588125] [2025-01-09 04:58:37,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:37,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:38,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-01-09 04:58:38,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-01-09 04:58:38,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:38,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:38,917 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:38,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:38,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770588125] [2025-01-09 04:58:38,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770588125] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:38,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:38,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:58:38,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154477646] [2025-01-09 04:58:38,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:38,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:58:38,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:38,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:58:38,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:58:38,919 INFO L87 Difference]: Start difference. First operand 61508 states and 93055 transitions. Second operand has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 0 states have call successors, (0), 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:39,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:39,332 INFO L93 Difference]: Finished difference Result 183035 states and 276566 transitions. [2025-01-09 04:58:39,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:58:39,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 0 states have call successors, (0), 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 332 [2025-01-09 04:58:39,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:39,483 INFO L225 Difference]: With dead ends: 183035 [2025-01-09 04:58:39,484 INFO L226 Difference]: Without dead ends: 122393 [2025-01-09 04:58:39,550 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:39,551 INFO L435 NwaCegarLoop]: 2437 mSDtfsCounter, 1200 mSDsluCounter, 3673 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1200 SdHoareTripleChecker+Valid, 6110 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:39,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1200 Valid, 6110 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:39,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122393 states. [2025-01-09 04:58:40,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122393 to 61943. [2025-01-09 04:58:40,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61943 states, 61942 states have (on average 1.513738658745278) internal successors, (93764), 61942 states have internal predecessors, (93764), 0 states have call successors, (0), 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:40,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61943 states to 61943 states and 93764 transitions. [2025-01-09 04:58:40,933 INFO L78 Accepts]: Start accepts. Automaton has 61943 states and 93764 transitions. Word has length 332 [2025-01-09 04:58:40,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:40,933 INFO L471 AbstractCegarLoop]: Abstraction has 61943 states and 93764 transitions. [2025-01-09 04:58:40,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 0 states have call successors, (0), 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:40,934 INFO L276 IsEmpty]: Start isEmpty. Operand 61943 states and 93764 transitions. [2025-01-09 04:58:40,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-01-09 04:58:40,983 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:40,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:58:40,984 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:40,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:40,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1007927346, now seen corresponding path program 1 times [2025-01-09 04:58:40,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:40,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875176558] [2025-01-09 04:58:40,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:40,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:41,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-01-09 04:58:41,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-01-09 04:58:41,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:41,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:41,129 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:41,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:41,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875176558] [2025-01-09 04:58:41,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875176558] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:41,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:41,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:58:41,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622912900] [2025-01-09 04:58:41,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:41,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:58:41,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:41,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:58:41,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:58:41,131 INFO L87 Difference]: Start difference. First operand 61943 states and 93764 transitions. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 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:41,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:41,810 INFO L93 Difference]: Finished difference Result 158191 states and 241402 transitions. [2025-01-09 04:58:41,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:58:41,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 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 334 [2025-01-09 04:58:41,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:41,941 INFO L225 Difference]: With dead ends: 158191 [2025-01-09 04:58:41,941 INFO L226 Difference]: Without dead ends: 99513 [2025-01-09 04:58:41,989 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:41,989 INFO L435 NwaCegarLoop]: 1737 mSDtfsCounter, 695 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 2747 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:58:41,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 2747 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:58:42,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99513 states. [2025-01-09 04:58:43,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99513 to 77879. [2025-01-09 04:58:43,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77879 states, 77878 states have (on average 1.5396902848044378) internal successors, (119908), 77878 states have internal predecessors, (119908), 0 states have call successors, (0), 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:43,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77879 states to 77879 states and 119908 transitions. [2025-01-09 04:58:43,633 INFO L78 Accepts]: Start accepts. Automaton has 77879 states and 119908 transitions. Word has length 334 [2025-01-09 04:58:43,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:43,633 INFO L471 AbstractCegarLoop]: Abstraction has 77879 states and 119908 transitions. [2025-01-09 04:58:43,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 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:43,634 INFO L276 IsEmpty]: Start isEmpty. Operand 77879 states and 119908 transitions. [2025-01-09 04:58:43,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-01-09 04:58:43,666 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:43,667 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:58:43,667 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:43,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:43,668 INFO L85 PathProgramCache]: Analyzing trace with hash -509294144, now seen corresponding path program 1 times [2025-01-09 04:58:43,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:43,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485690550] [2025-01-09 04:58:43,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:43,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:43,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-01-09 04:58:43,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-01-09 04:58:43,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:43,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:43,758 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:43,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:43,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485690550] [2025-01-09 04:58:43,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485690550] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:43,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:43,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:58:43,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35026337] [2025-01-09 04:58:43,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:43,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:58:43,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:43,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:58:43,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:58:43,760 INFO L87 Difference]: Start difference. First operand 77879 states and 119908 transitions. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 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:44,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:44,306 INFO L93 Difference]: Finished difference Result 230985 states and 355139 transitions. [2025-01-09 04:58:44,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:58:44,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 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 334 [2025-01-09 04:58:44,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:44,479 INFO L225 Difference]: With dead ends: 230985 [2025-01-09 04:58:44,479 INFO L226 Difference]: Without dead ends: 154467 [2025-01-09 04:58:44,552 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:44,553 INFO L435 NwaCegarLoop]: 2338 mSDtfsCounter, 1100 mSDsluCounter, 1232 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1100 SdHoareTripleChecker+Valid, 3570 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:44,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1100 Valid, 3570 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:44,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154467 states. [2025-01-09 04:58:46,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154467 to 78081. [2025-01-09 04:58:46,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78081 states, 78080 states have (on average 1.5392546106557377) internal successors, (120185), 78080 states have internal predecessors, (120185), 0 states have call successors, (0), 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:46,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78081 states to 78081 states and 120185 transitions. [2025-01-09 04:58:46,451 INFO L78 Accepts]: Start accepts. Automaton has 78081 states and 120185 transitions. Word has length 334 [2025-01-09 04:58:46,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:46,451 INFO L471 AbstractCegarLoop]: Abstraction has 78081 states and 120185 transitions. [2025-01-09 04:58:46,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 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:46,452 INFO L276 IsEmpty]: Start isEmpty. Operand 78081 states and 120185 transitions. [2025-01-09 04:58:46,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-01-09 04:58:46,486 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:46,486 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:58:46,486 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:46,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:46,487 INFO L85 PathProgramCache]: Analyzing trace with hash -708946404, now seen corresponding path program 1 times [2025-01-09 04:58:46,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:46,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327041969] [2025-01-09 04:58:46,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:46,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:46,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-01-09 04:58:46,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-01-09 04:58:46,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:46,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:46,586 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:46,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:46,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327041969] [2025-01-09 04:58:46,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327041969] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:46,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:46,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:58:46,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946946663] [2025-01-09 04:58:46,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:46,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:58:46,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:46,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:58:46,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:58:46,588 INFO L87 Difference]: Start difference. First operand 78081 states and 120185 transitions. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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:46,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:46,894 INFO L93 Difference]: Finished difference Result 154855 states and 238114 transitions. [2025-01-09 04:58:46,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:58:46,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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 335 [2025-01-09 04:58:46,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:46,981 INFO L225 Difference]: With dead ends: 154855 [2025-01-09 04:58:46,982 INFO L226 Difference]: Without dead ends: 78324 [2025-01-09 04:58:47,047 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:47,048 INFO L435 NwaCegarLoop]: 1256 mSDtfsCounter, 5 mSDsluCounter, 1240 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2496 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:47,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2496 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:47,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78324 states. [2025-01-09 04:58:48,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78324 to 78324. [2025-01-09 04:58:48,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78324 states, 78323 states have (on average 1.538092258978844) internal successors, (120468), 78323 states have internal predecessors, (120468), 0 states have call successors, (0), 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:48,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78324 states to 78324 states and 120468 transitions. [2025-01-09 04:58:48,234 INFO L78 Accepts]: Start accepts. Automaton has 78324 states and 120468 transitions. Word has length 335 [2025-01-09 04:58:48,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:48,234 INFO L471 AbstractCegarLoop]: Abstraction has 78324 states and 120468 transitions. [2025-01-09 04:58:48,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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:48,235 INFO L276 IsEmpty]: Start isEmpty. Operand 78324 states and 120468 transitions. [2025-01-09 04:58:48,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-01-09 04:58:48,270 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:48,270 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:58:48,271 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:48,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:48,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1552437421, now seen corresponding path program 1 times [2025-01-09 04:58:48,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:48,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350859925] [2025-01-09 04:58:48,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:48,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:48,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-01-09 04:58:48,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-01-09 04:58:48,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:48,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:49,042 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:49,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:49,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350859925] [2025-01-09 04:58:49,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350859925] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:49,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:49,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:58:49,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415167796] [2025-01-09 04:58:49,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:49,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:58:49,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:49,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:58:49,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:58:49,044 INFO L87 Difference]: Start difference. First operand 78324 states and 120468 transitions. Second operand has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 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:49,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:49,407 INFO L93 Difference]: Finished difference Result 156602 states and 240828 transitions. [2025-01-09 04:58:49,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:58:49,408 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 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 336 [2025-01-09 04:58:49,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:49,692 INFO L225 Difference]: With dead ends: 156602 [2025-01-09 04:58:49,692 INFO L226 Difference]: Without dead ends: 79749 [2025-01-09 04:58:49,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:49,728 INFO L435 NwaCegarLoop]: 1361 mSDtfsCounter, 94 mSDsluCounter, 2594 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 3955 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:49,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 3955 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:49,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79749 states. [2025-01-09 04:58:50,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79749 to 79401. [2025-01-09 04:58:50,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79401 states, 79400 states have (on average 1.5401007556675064) internal successors, (122284), 79400 states have internal predecessors, (122284), 0 states have call successors, (0), 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:50,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79401 states to 79401 states and 122284 transitions. [2025-01-09 04:58:50,849 INFO L78 Accepts]: Start accepts. Automaton has 79401 states and 122284 transitions. Word has length 336 [2025-01-09 04:58:50,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:50,849 INFO L471 AbstractCegarLoop]: Abstraction has 79401 states and 122284 transitions. [2025-01-09 04:58:50,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 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:50,849 INFO L276 IsEmpty]: Start isEmpty. Operand 79401 states and 122284 transitions. [2025-01-09 04:58:50,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-01-09 04:58:50,885 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:50,885 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:58:50,886 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:50,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:50,886 INFO L85 PathProgramCache]: Analyzing trace with hash -646373614, now seen corresponding path program 1 times [2025-01-09 04:58:50,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:50,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983014027] [2025-01-09 04:58:50,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:50,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:50,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-01-09 04:58:50,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-01-09 04:58:50,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:50,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:50,990 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:50,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:50,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983014027] [2025-01-09 04:58:50,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983014027] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:50,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:50,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:58:50,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118487195] [2025-01-09 04:58:50,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:50,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:58:50,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:50,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:58:50,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:58:50,992 INFO L87 Difference]: Start difference. First operand 79401 states and 122284 transitions. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 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:51,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:51,664 INFO L93 Difference]: Finished difference Result 234299 states and 360300 transitions. [2025-01-09 04:58:51,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:58:51,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 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 336 [2025-01-09 04:58:51,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:51,833 INFO L225 Difference]: With dead ends: 234299 [2025-01-09 04:58:51,833 INFO L226 Difference]: Without dead ends: 155441 [2025-01-09 04:58:51,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:58:51,897 INFO L435 NwaCegarLoop]: 2408 mSDtfsCounter, 1082 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1082 SdHoareTripleChecker+Valid, 3590 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:58:51,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1082 Valid, 3590 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:58:52,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155441 states. [2025-01-09 04:58:54,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155441 to 155439. [2025-01-09 04:58:54,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155439 states, 155438 states have (on average 1.529748195421969) internal successors, (237781), 155438 states have internal predecessors, (237781), 0 states have call successors, (0), 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:54,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155439 states to 155439 states and 237781 transitions. [2025-01-09 04:58:54,673 INFO L78 Accepts]: Start accepts. Automaton has 155439 states and 237781 transitions. Word has length 336 [2025-01-09 04:58:54,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:54,673 INFO L471 AbstractCegarLoop]: Abstraction has 155439 states and 237781 transitions. [2025-01-09 04:58:54,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 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:54,673 INFO L276 IsEmpty]: Start isEmpty. Operand 155439 states and 237781 transitions. [2025-01-09 04:58:54,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-01-09 04:58:54,745 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:54,745 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:58:54,746 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:54,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:54,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1386520815, now seen corresponding path program 1 times [2025-01-09 04:58:54,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:54,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599643640] [2025-01-09 04:58:54,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:54,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:54,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-01-09 04:58:54,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-01-09 04:58:54,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:54,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:55,566 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:55,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:55,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599643640] [2025-01-09 04:58:55,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599643640] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:55,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:55,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:58:55,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249825367] [2025-01-09 04:58:55,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:55,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:58:55,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:55,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:58:55,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:58:55,570 INFO L87 Difference]: Start difference. First operand 155439 states and 237781 transitions. Second operand has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 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:56,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:56,022 INFO L93 Difference]: Finished difference Result 288043 states and 439801 transitions. [2025-01-09 04:58:56,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:58:56,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 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 336 [2025-01-09 04:58:56,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:56,180 INFO L225 Difference]: With dead ends: 288043 [2025-01-09 04:58:56,180 INFO L226 Difference]: Without dead ends: 137489 [2025-01-09 04:58:56,290 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:56,290 INFO L435 NwaCegarLoop]: 1383 mSDtfsCounter, 99 mSDsluCounter, 2621 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 4004 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:56,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 4004 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:56,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137489 states. [2025-01-09 04:58:58,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137489 to 137229. [2025-01-09 04:58:58,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137229 states, 137228 states have (on average 1.5286166088553357) internal successors, (209769), 137228 states have internal predecessors, (209769), 0 states have call successors, (0), 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:58,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137229 states to 137229 states and 209769 transitions. [2025-01-09 04:58:58,964 INFO L78 Accepts]: Start accepts. Automaton has 137229 states and 209769 transitions. Word has length 336 [2025-01-09 04:58:58,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:58,964 INFO L471 AbstractCegarLoop]: Abstraction has 137229 states and 209769 transitions. [2025-01-09 04:58:58,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 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:58,964 INFO L276 IsEmpty]: Start isEmpty. Operand 137229 states and 209769 transitions. [2025-01-09 04:58:59,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2025-01-09 04:58:59,024 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:59,025 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:58:59,025 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:59,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:59,025 INFO L85 PathProgramCache]: Analyzing trace with hash 2039427818, now seen corresponding path program 1 times [2025-01-09 04:58:59,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:59,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777633277] [2025-01-09 04:58:59,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:59,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:59,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-01-09 04:58:59,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-01-09 04:58:59,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:59,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:59,136 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:59,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:59,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777633277] [2025-01-09 04:58:59,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777633277] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:59,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:59,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:58:59,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676887000] [2025-01-09 04:58:59,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:59,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:58:59,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:59,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:58:59,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:58:59,139 INFO L87 Difference]: Start difference. First operand 137229 states and 209769 transitions. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 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:59:00,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:59:00,275 INFO L93 Difference]: Finished difference Result 385541 states and 587223 transitions. [2025-01-09 04:59:00,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:59:00,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 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 337 [2025-01-09 04:59:00,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:59:00,608 INFO L225 Difference]: With dead ends: 385541 [2025-01-09 04:59:00,609 INFO L226 Difference]: Without dead ends: 252593 [2025-01-09 04:59:00,704 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:59:00,706 INFO L435 NwaCegarLoop]: 2319 mSDtfsCounter, 1093 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1093 SdHoareTripleChecker+Valid, 3499 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:59:00,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1093 Valid, 3499 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:59:00,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252593 states. [2025-01-09 04:59:04,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252593 to 252591. [2025-01-09 04:59:04,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252591 states, 252590 states have (on average 1.5151985430935508) internal successors, (382724), 252590 states have internal predecessors, (382724), 0 states have call successors, (0), 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:59:05,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252591 states to 252591 states and 382724 transitions. [2025-01-09 04:59:05,346 INFO L78 Accepts]: Start accepts. Automaton has 252591 states and 382724 transitions. Word has length 337 [2025-01-09 04:59:05,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:59:05,347 INFO L471 AbstractCegarLoop]: Abstraction has 252591 states and 382724 transitions. [2025-01-09 04:59:05,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 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:59:05,347 INFO L276 IsEmpty]: Start isEmpty. Operand 252591 states and 382724 transitions. [2025-01-09 04:59:05,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-01-09 04:59:05,478 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:59:05,478 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:05,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:59:05,478 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:59:05,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:59:05,479 INFO L85 PathProgramCache]: Analyzing trace with hash 597999128, now seen corresponding path program 1 times [2025-01-09 04:59:05,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:59:05,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304298916] [2025-01-09 04:59:05,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:59:05,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:59:05,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-01-09 04:59:05,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-01-09 04:59:05,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:59:05,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:59:05,640 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:59:05,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:59:05,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304298916] [2025-01-09 04:59:05,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304298916] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:59:05,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:59:05,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:59:05,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9551508] [2025-01-09 04:59:05,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:59:05,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:59:05,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:59:05,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:59:05,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:59:05,645 INFO L87 Difference]: Start difference. First operand 252591 states and 382724 transitions. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)