./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.v+cfa-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_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.v+cfa-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 8dbdfeb1f17d8b6d14f86f0330503f4a2b5f36d22c7b983f35706e613bc02676 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:46:23,245 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:46:23,311 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:46:23,314 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:46:23,314 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:46:23,331 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:46:23,332 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:46:23,332 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:46:23,332 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:46:23,332 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:46:23,332 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:46:23,332 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:46:23,332 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:46:23,332 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:46:23,333 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:46:23,333 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:46:23,333 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:46:23,333 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:46:23,333 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:46:23,333 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:46:23,333 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:46:23,333 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:46:23,333 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:46:23,333 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:46:23,333 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:46:23,333 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:46:23,333 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:46:23,333 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:46:23,333 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:46:23,333 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:46:23,333 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:46:23,333 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:46:23,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:46:23,334 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:46:23,334 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:46:23,334 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:46:23,334 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:46:23,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:46:23,334 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:46:23,334 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:46:23,334 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:46:23,334 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:46:23,334 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:46:23,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:46:23,334 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:46:23,334 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:46:23,334 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:46:23,334 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:46:23,334 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 -> 8dbdfeb1f17d8b6d14f86f0330503f4a2b5f36d22c7b983f35706e613bc02676 [2025-01-09 04:46:23,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:46:23,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:46:23,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:46:23,568 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:46:23,568 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:46:23,569 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2025-01-09 04:46:24,867 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ed759bb6/a2994604feae4563aa026c9a58548e4d/FLAG942660e5a [2025-01-09 04:46:25,245 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:46:25,250 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2025-01-09 04:46:25,264 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ed759bb6/a2994604feae4563aa026c9a58548e4d/FLAG942660e5a [2025-01-09 04:46:25,280 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ed759bb6/a2994604feae4563aa026c9a58548e4d [2025-01-09 04:46:25,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:46:25,283 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:46:25,285 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:46:25,285 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:46:25,289 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:46:25,290 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:46:25" (1/1) ... [2025-01-09 04:46:25,290 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@644b0937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:25, skipping insertion in model container [2025-01-09 04:46:25,290 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:46:25" (1/1) ... [2025-01-09 04:46:25,339 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:46:25,506 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_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c[7365,7378] [2025-01-09 04:46:25,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:46:25,541 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:46:25,571 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_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c[7365,7378] [2025-01-09 04:46:25,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:46:25,600 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:46:25,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:25 WrapperNode [2025-01-09 04:46:25,601 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:46:25,602 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:46:25,602 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:46:25,602 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:46:25,606 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:46:25" (1/1) ... [2025-01-09 04:46:25,615 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:46:25" (1/1) ... [2025-01-09 04:46:25,645 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 674 [2025-01-09 04:46:25,646 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:46:25,646 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:46:25,646 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:46:25,646 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:46:25,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:25" (1/1) ... [2025-01-09 04:46:25,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:25" (1/1) ... [2025-01-09 04:46:25,656 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:25" (1/1) ... [2025-01-09 04:46:25,667 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:46:25,667 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:25" (1/1) ... [2025-01-09 04:46:25,667 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:25" (1/1) ... [2025-01-09 04:46:25,673 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:25" (1/1) ... [2025-01-09 04:46:25,675 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:25" (1/1) ... [2025-01-09 04:46:25,678 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:25" (1/1) ... [2025-01-09 04:46: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:46:25" (1/1) ... [2025-01-09 04:46:25,681 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:25" (1/1) ... [2025-01-09 04:46:25,683 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:46:25,684 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:46:25,684 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:46:25,684 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:46:25,685 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:25" (1/1) ... [2025-01-09 04:46:25,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:46:25,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:46:25,711 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:46:25,722 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:46:25,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:46:25,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:46:25,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:46:25,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:46:25,819 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:46:25,820 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:46:26,320 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2025-01-09 04:46:26,320 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:46:26,329 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:46:26,330 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:46:26,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:46:26 BoogieIcfgContainer [2025-01-09 04:46:26,330 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:46:26,332 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:46:26,332 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:46:26,335 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:46:26,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:46:25" (1/3) ... [2025-01-09 04:46:26,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d0896cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:46:26, skipping insertion in model container [2025-01-09 04:46:26,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:25" (2/3) ... [2025-01-09 04:46:26,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d0896cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:46:26, skipping insertion in model container [2025-01-09 04:46:26,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:46:26" (3/3) ... [2025-01-09 04:46:26,337 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2025-01-09 04:46:26,347 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:46:26,349 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c that has 1 procedures, 158 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 04:46:26,386 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:46:26,394 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;@75cb21ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:46:26,394 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:46:26,398 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 156 states have (on average 1.7115384615384615) internal successors, (267), 157 states have internal predecessors, (267), 0 states have call successors, (0), 0 states 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:46:26,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 04:46:26,404 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:46:26,404 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] [2025-01-09 04:46:26,404 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:46:26,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:46:26,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1878373097, now seen corresponding path program 1 times [2025-01-09 04:46:26,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:46:26,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436251554] [2025-01-09 04:46:26,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:26,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:46:26,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 04:46:26,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 04:46:26,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:26,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:26,727 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:46:26,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:26,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436251554] [2025-01-09 04:46:26,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436251554] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:46:26,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:46:26,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:46:26,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395857657] [2025-01-09 04:46:26,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:46:26,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:46:26,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:26,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:46:26,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:46:26,746 INFO L87 Difference]: Start difference. First operand has 158 states, 156 states have (on average 1.7115384615384615) internal successors, (267), 157 states have internal predecessors, (267), 0 states have call successors, (0), 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 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states 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:46:26,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:46:26,789 INFO L93 Difference]: Finished difference Result 370 states and 603 transitions. [2025-01-09 04:46:26,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:46:26,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2025-01-09 04:46:26,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:46:26,797 INFO L225 Difference]: With dead ends: 370 [2025-01-09 04:46:26,797 INFO L226 Difference]: Without dead ends: 250 [2025-01-09 04:46:26,800 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:46:26,801 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 196 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:46:26,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 572 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:46:26,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-01-09 04:46:26,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2025-01-09 04:46:26,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 1.4979757085020242) internal successors, (370), 247 states have internal predecessors, (370), 0 states have call successors, (0), 0 states 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:46:26,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 370 transitions. [2025-01-09 04:46:26,833 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 370 transitions. Word has length 73 [2025-01-09 04:46:26,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:46:26,833 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 370 transitions. [2025-01-09 04:46:26,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states 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:46:26,834 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 370 transitions. [2025-01-09 04:46:26,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 04:46:26,835 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:46:26,835 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] [2025-01-09 04:46:26,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:46:26,836 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:46:26,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:46:26,836 INFO L85 PathProgramCache]: Analyzing trace with hash 32941141, now seen corresponding path program 1 times [2025-01-09 04:46:26,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:46:26,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394200696] [2025-01-09 04:46:26,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:26,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:46:26,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 04:46:26,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 04:46:26,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:26,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:26,989 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:46:26,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:26,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394200696] [2025-01-09 04:46:26,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394200696] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:46:26,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:46:26,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:46:26,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651875477] [2025-01-09 04:46:26,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:46:26,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:46:26,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:26,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:46:26,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:46:26,991 INFO L87 Difference]: Start difference. First operand 248 states and 370 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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:46:27,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:46:27,023 INFO L93 Difference]: Finished difference Result 624 states and 970 transitions. [2025-01-09 04:46:27,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:46:27,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2025-01-09 04:46:27,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:46:27,026 INFO L225 Difference]: With dead ends: 624 [2025-01-09 04:46:27,026 INFO L226 Difference]: Without dead ends: 420 [2025-01-09 04:46:27,026 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:46:27,027 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 156 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:46:27,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 498 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:46:27,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-01-09 04:46:27,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 418. [2025-01-09 04:46:27,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 1.5371702637889688) internal successors, (641), 417 states have internal predecessors, (641), 0 states have call successors, (0), 0 states 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:46:27,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 641 transitions. [2025-01-09 04:46:27,052 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 641 transitions. Word has length 74 [2025-01-09 04:46:27,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:46:27,052 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 641 transitions. [2025-01-09 04:46:27,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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:46:27,053 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 641 transitions. [2025-01-09 04:46:27,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 04:46:27,054 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:46:27,054 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] [2025-01-09 04:46:27,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:46:27,054 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:46:27,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:46:27,056 INFO L85 PathProgramCache]: Analyzing trace with hash 2013184178, now seen corresponding path program 1 times [2025-01-09 04:46:27,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:46:27,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659521933] [2025-01-09 04:46:27,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:27,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:46:27,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 04:46:27,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 04:46:27,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:27,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:27,198 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:46:27,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:27,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659521933] [2025-01-09 04:46:27,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659521933] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:46:27,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:46:27,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:46:27,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668112419] [2025-01-09 04:46:27,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:46:27,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:46:27,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:27,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:46:27,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:46:27,201 INFO L87 Difference]: Start difference. First operand 418 states and 641 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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:46:27,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:46:27,230 INFO L93 Difference]: Finished difference Result 1102 states and 1731 transitions. [2025-01-09 04:46:27,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:46:27,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-01-09 04:46:27,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:46:27,236 INFO L225 Difference]: With dead ends: 1102 [2025-01-09 04:46:27,236 INFO L226 Difference]: Without dead ends: 728 [2025-01-09 04:46:27,237 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:46:27,241 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 151 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:46:27,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 483 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:46:27,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2025-01-09 04:46:27,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 726. [2025-01-09 04:46:27,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 725 states have (on average 1.5572413793103448) internal successors, (1129), 725 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states 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:46:27,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1129 transitions. [2025-01-09 04:46:27,260 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1129 transitions. Word has length 75 [2025-01-09 04:46:27,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:46:27,261 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 1129 transitions. [2025-01-09 04:46:27,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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:46:27,261 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1129 transitions. [2025-01-09 04:46:27,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 04:46:27,262 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:46:27,262 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] [2025-01-09 04:46:27,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:46:27,263 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:46:27,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:46:27,263 INFO L85 PathProgramCache]: Analyzing trace with hash -360572760, now seen corresponding path program 1 times [2025-01-09 04:46:27,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:46:27,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646345116] [2025-01-09 04:46:27,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:27,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:46:27,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 04:46:27,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 04:46:27,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:27,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:27,438 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:46:27,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:27,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646345116] [2025-01-09 04:46:27,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646345116] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:46:27,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:46:27,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:46:27,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308240006] [2025-01-09 04:46:27,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:46:27,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:46:27,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:27,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:46:27,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:46:27,444 INFO L87 Difference]: Start difference. First operand 726 states and 1129 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states 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:46:27,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:46:27,496 INFO L93 Difference]: Finished difference Result 1962 states and 3091 transitions. [2025-01-09 04:46:27,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:46:27,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-01-09 04:46:27,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:46:27,502 INFO L225 Difference]: With dead ends: 1962 [2025-01-09 04:46:27,502 INFO L226 Difference]: Without dead ends: 1280 [2025-01-09 04:46:27,503 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:46:27,503 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 146 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:46:27,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 468 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:46:27,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2025-01-09 04:46:27,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1278. [2025-01-09 04:46:27,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1278 states, 1277 states have (on average 1.5638214565387627) internal successors, (1997), 1277 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states 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:46:27,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 1997 transitions. [2025-01-09 04:46:27,527 INFO L78 Accepts]: Start accepts. Automaton has 1278 states and 1997 transitions. Word has length 76 [2025-01-09 04:46:27,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:46:27,527 INFO L471 AbstractCegarLoop]: Abstraction has 1278 states and 1997 transitions. [2025-01-09 04:46:27,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states 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:46:27,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1997 transitions. [2025-01-09 04:46:27,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 04:46:27,529 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:46:27,529 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:46:27,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:46:27,530 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:46:27,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:46:27,530 INFO L85 PathProgramCache]: Analyzing trace with hash 25557647, now seen corresponding path program 1 times [2025-01-09 04:46:27,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:46:27,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462369742] [2025-01-09 04:46:27,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:27,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:46:27,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 04:46:27,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 04:46:27,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:27,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:27,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:46:27,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:27,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462369742] [2025-01-09 04:46:27,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462369742] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:46:27,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:46:27,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:46:27,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586282479] [2025-01-09 04:46:27,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:46:27,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:46:27,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:27,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:46:27,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:46:27,643 INFO L87 Difference]: Start difference. First operand 1278 states and 1997 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:27,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:46:27,671 INFO L93 Difference]: Finished difference Result 3490 states and 5487 transitions. [2025-01-09 04:46:27,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:46:27,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-01-09 04:46:27,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:46:27,679 INFO L225 Difference]: With dead ends: 3490 [2025-01-09 04:46:27,679 INFO L226 Difference]: Without dead ends: 2256 [2025-01-09 04:46:27,681 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:46:27,682 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 141 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:46:27,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 453 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:46:27,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2256 states. [2025-01-09 04:46:27,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2256 to 2254. [2025-01-09 04:46:27,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2254 states, 2253 states have (on average 1.5610297381269418) internal successors, (3517), 2253 states have internal predecessors, (3517), 0 states have call successors, (0), 0 states 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:46:27,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 3517 transitions. [2025-01-09 04:46:27,729 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 3517 transitions. Word has length 77 [2025-01-09 04:46:27,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:46:27,729 INFO L471 AbstractCegarLoop]: Abstraction has 2254 states and 3517 transitions. [2025-01-09 04:46:27,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:27,730 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 3517 transitions. [2025-01-09 04:46:27,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 04:46:27,730 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:46:27,730 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:46:27,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:46:27,731 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:46:27,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:46:27,731 INFO L85 PathProgramCache]: Analyzing trace with hash 551922959, now seen corresponding path program 1 times [2025-01-09 04:46:27,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:46:27,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432510442] [2025-01-09 04:46:27,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:27,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:46:27,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 04:46:27,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 04:46:27,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:27,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:27,924 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:46:27,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:27,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432510442] [2025-01-09 04:46:27,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432510442] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:46:27,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:46:27,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:46:27,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635313849] [2025-01-09 04:46:27,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:46:27,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:46:27,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:27,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:46:27,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:46:27,930 INFO L87 Difference]: Start difference. First operand 2254 states and 3517 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:28,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:46:28,183 INFO L93 Difference]: Finished difference Result 17724 states and 27828 transitions. [2025-01-09 04:46:28,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:46:28,184 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-01-09 04:46:28,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:46:28,233 INFO L225 Difference]: With dead ends: 17724 [2025-01-09 04:46:28,233 INFO L226 Difference]: Without dead ends: 15514 [2025-01-09 04:46:28,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:46:28,245 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 2448 mSDsluCounter, 2866 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2448 SdHoareTripleChecker+Valid, 3085 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:46:28,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2448 Valid, 3085 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:46:28,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15514 states. [2025-01-09 04:46:28,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15514 to 4462. [2025-01-09 04:46:28,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4462 states, 4461 states have (on average 1.552342524097736) internal successors, (6925), 4461 states have internal predecessors, (6925), 0 states have call successors, (0), 0 states 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:46:28,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4462 states to 4462 states and 6925 transitions. [2025-01-09 04:46:28,469 INFO L78 Accepts]: Start accepts. Automaton has 4462 states and 6925 transitions. Word has length 78 [2025-01-09 04:46:28,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:46:28,469 INFO L471 AbstractCegarLoop]: Abstraction has 4462 states and 6925 transitions. [2025-01-09 04:46:28,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:28,469 INFO L276 IsEmpty]: Start isEmpty. Operand 4462 states and 6925 transitions. [2025-01-09 04:46:28,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 04:46:28,470 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:46:28,470 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:46:28,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:46:28,470 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:46:28,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:46:28,470 INFO L85 PathProgramCache]: Analyzing trace with hash -89713652, now seen corresponding path program 1 times [2025-01-09 04:46:28,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:46:28,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803629385] [2025-01-09 04:46:28,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:28,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:46:28,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 04:46:28,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 04:46:28,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:28,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:28,747 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:46:28,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:28,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803629385] [2025-01-09 04:46:28,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803629385] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:46:28,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:46:28,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:46:28,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724862960] [2025-01-09 04:46:28,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:46:28,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:46:28,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:28,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:46:28,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:46:28,750 INFO L87 Difference]: Start difference. First operand 4462 states and 6925 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:29,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:46:29,010 INFO L93 Difference]: Finished difference Result 27290 states and 42131 transitions. [2025-01-09 04:46:29,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:46:29,010 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-01-09 04:46:29,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:46:29,053 INFO L225 Difference]: With dead ends: 27290 [2025-01-09 04:46:29,054 INFO L226 Difference]: Without dead ends: 22872 [2025-01-09 04:46:29,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:46:29,061 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 891 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 1785 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:46:29,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 1785 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:46:29,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22872 states. [2025-01-09 04:46:29,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22872 to 22862. [2025-01-09 04:46:29,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22862 states, 22861 states have (on average 1.5389090590962775) internal successors, (35181), 22861 states have internal predecessors, (35181), 0 states have call successors, (0), 0 states 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:46:29,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22862 states to 22862 states and 35181 transitions. [2025-01-09 04:46:29,458 INFO L78 Accepts]: Start accepts. Automaton has 22862 states and 35181 transitions. Word has length 79 [2025-01-09 04:46:29,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:46:29,458 INFO L471 AbstractCegarLoop]: Abstraction has 22862 states and 35181 transitions. [2025-01-09 04:46:29,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:29,458 INFO L276 IsEmpty]: Start isEmpty. Operand 22862 states and 35181 transitions. [2025-01-09 04:46:29,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 04:46:29,459 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:46:29,459 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:46:29,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:46:29,460 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:46:29,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:46:29,460 INFO L85 PathProgramCache]: Analyzing trace with hash 695109453, now seen corresponding path program 1 times [2025-01-09 04:46:29,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:46:29,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432478800] [2025-01-09 04:46:29,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:29,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:46:29,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 04:46:29,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 04:46:29,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:29,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:29,517 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:46:29,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:29,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432478800] [2025-01-09 04:46:29,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432478800] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:46:29,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:46:29,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:46:29,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238767003] [2025-01-09 04:46:29,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:46:29,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:46:29,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:29,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:46:29,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:46:29,519 INFO L87 Difference]: Start difference. First operand 22862 states and 35181 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:29,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:46:29,814 INFO L93 Difference]: Finished difference Result 64274 states and 98543 transitions. [2025-01-09 04:46:29,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:46:29,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-01-09 04:46:29,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:46:29,927 INFO L225 Difference]: With dead ends: 64274 [2025-01-09 04:46:29,928 INFO L226 Difference]: Without dead ends: 41456 [2025-01-09 04:46:29,947 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:46:29,948 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 165 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:46:29,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 546 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:46:29,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41456 states. [2025-01-09 04:46:30,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41456 to 41454. [2025-01-09 04:46:30,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41454 states, 41453 states have (on average 1.5203000989071962) internal successors, (63021), 41453 states have internal predecessors, (63021), 0 states have call successors, (0), 0 states 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:46:30,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41454 states to 41454 states and 63021 transitions. [2025-01-09 04:46:30,641 INFO L78 Accepts]: Start accepts. Automaton has 41454 states and 63021 transitions. Word has length 79 [2025-01-09 04:46:30,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:46:30,641 INFO L471 AbstractCegarLoop]: Abstraction has 41454 states and 63021 transitions. [2025-01-09 04:46:30,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:30,643 INFO L276 IsEmpty]: Start isEmpty. Operand 41454 states and 63021 transitions. [2025-01-09 04:46:30,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 04:46:30,644 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:46:30,644 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:46:30,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:46:30,645 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:46:30,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:46:30,646 INFO L85 PathProgramCache]: Analyzing trace with hash -684137867, now seen corresponding path program 1 times [2025-01-09 04:46:30,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:46:30,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258658027] [2025-01-09 04:46:30,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:30,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:46:30,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 04:46:30,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 04:46:30,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:30,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:30,935 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:46:30,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:30,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258658027] [2025-01-09 04:46:30,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258658027] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:46:30,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:46:30,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:46:30,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392703573] [2025-01-09 04:46:30,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:46:30,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:46:30,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:30,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:46:30,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:46:30,937 INFO L87 Difference]: Start difference. First operand 41454 states and 63021 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:31,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:46:31,471 INFO L93 Difference]: Finished difference Result 124274 states and 188975 transitions. [2025-01-09 04:46:31,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:46:31,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-09 04:46:31,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:46:31,612 INFO L225 Difference]: With dead ends: 124274 [2025-01-09 04:46:31,612 INFO L226 Difference]: Without dead ends: 82864 [2025-01-09 04:46:31,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:46:31,661 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 940 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 940 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:46:31,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [940 Valid, 254 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:46:31,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82864 states. [2025-01-09 04:46:32,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82864 to 82862. [2025-01-09 04:46:32,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82862 states, 82861 states have (on average 1.5128588841553927) internal successors, (125357), 82861 states have internal predecessors, (125357), 0 states have call successors, (0), 0 states 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:46:33,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82862 states to 82862 states and 125357 transitions. [2025-01-09 04:46:33,069 INFO L78 Accepts]: Start accepts. Automaton has 82862 states and 125357 transitions. Word has length 81 [2025-01-09 04:46:33,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:46:33,069 INFO L471 AbstractCegarLoop]: Abstraction has 82862 states and 125357 transitions. [2025-01-09 04:46:33,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:33,069 INFO L276 IsEmpty]: Start isEmpty. Operand 82862 states and 125357 transitions. [2025-01-09 04:46:33,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 04:46:33,070 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:46:33,070 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:46:33,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:46:33,070 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:46:33,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:46:33,071 INFO L85 PathProgramCache]: Analyzing trace with hash -2081093798, now seen corresponding path program 1 times [2025-01-09 04:46:33,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:46:33,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809124937] [2025-01-09 04:46:33,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:33,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:46:33,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 04:46:33,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 04:46:33,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:33,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:33,364 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:46:33,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:33,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809124937] [2025-01-09 04:46:33,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809124937] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:46:33,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:46:33,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:46:33,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315872914] [2025-01-09 04:46:33,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:46:33,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:46:33,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:33,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:46:33,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:46:33,366 INFO L87 Difference]: Start difference. First operand 82862 states and 125357 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:34,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:46:34,018 INFO L93 Difference]: Finished difference Result 85936 states and 129966 transitions. [2025-01-09 04:46:34,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:46:34,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-09 04:46:34,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:46:34,123 INFO L225 Difference]: With dead ends: 85936 [2025-01-09 04:46:34,124 INFO L226 Difference]: Without dead ends: 85934 [2025-01-09 04:46:34,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:46:34,134 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 0 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:46:34,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 861 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:46:34,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85934 states. [2025-01-09 04:46:34,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85934 to 85934. [2025-01-09 04:46:34,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85934 states, 85933 states have (on average 1.4945248042079293) internal successors, (128429), 85933 states have internal predecessors, (128429), 0 states have call successors, (0), 0 states 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:46:35,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85934 states to 85934 states and 128429 transitions. [2025-01-09 04:46:35,138 INFO L78 Accepts]: Start accepts. Automaton has 85934 states and 128429 transitions. Word has length 81 [2025-01-09 04:46:35,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:46:35,138 INFO L471 AbstractCegarLoop]: Abstraction has 85934 states and 128429 transitions. [2025-01-09 04:46:35,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:35,138 INFO L276 IsEmpty]: Start isEmpty. Operand 85934 states and 128429 transitions. [2025-01-09 04:46:35,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 04:46:35,143 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:46:35,143 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] [2025-01-09 04:46:35,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:46:35,143 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:46:35,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:46:35,143 INFO L85 PathProgramCache]: Analyzing trace with hash -78825167, now seen corresponding path program 1 times [2025-01-09 04:46:35,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:46:35,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388247618] [2025-01-09 04:46:35,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:35,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:46:35,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 04:46:35,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 04:46:35,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:35,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:35,236 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:46:35,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:35,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388247618] [2025-01-09 04:46:35,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388247618] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:46:35,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:46:35,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:46:35,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723429494] [2025-01-09 04:46:35,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:46:35,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:46:35,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:35,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:46:35,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:46:35,237 INFO L87 Difference]: Start difference. First operand 85934 states and 128429 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states 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:46:36,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:46:36,077 INFO L93 Difference]: Finished difference Result 210420 states and 314337 transitions. [2025-01-09 04:46:36,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:46:36,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2025-01-09 04:46:36,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:46:36,227 INFO L225 Difference]: With dead ends: 210420 [2025-01-09 04:46:36,228 INFO L226 Difference]: Without dead ends: 124530 [2025-01-09 04:46:36,254 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:46:36,255 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 131 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:46:36,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 395 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:46:36,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124530 states. [2025-01-09 04:46:37,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124530 to 124528. [2025-01-09 04:46:37,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124528 states, 124527 states have (on average 1.4876050976896578) internal successors, (185247), 124527 states have internal predecessors, (185247), 0 states have call successors, (0), 0 states 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:46:38,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124528 states to 124528 states and 185247 transitions. [2025-01-09 04:46:38,199 INFO L78 Accepts]: Start accepts. Automaton has 124528 states and 185247 transitions. Word has length 82 [2025-01-09 04:46:38,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:46:38,200 INFO L471 AbstractCegarLoop]: Abstraction has 124528 states and 185247 transitions. [2025-01-09 04:46:38,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states 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:46:38,200 INFO L276 IsEmpty]: Start isEmpty. Operand 124528 states and 185247 transitions. [2025-01-09 04:46:38,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 04:46:38,227 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:46:38,227 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:46:38,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:46:38,228 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:46:38,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:46:38,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1944041502, now seen corresponding path program 1 times [2025-01-09 04:46:38,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:46:38,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240181163] [2025-01-09 04:46:38,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:38,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:46:38,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 04:46:38,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 04:46:38,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:38,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:38,491 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:46:38,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:38,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240181163] [2025-01-09 04:46:38,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240181163] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:46:38,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673407915] [2025-01-09 04:46:38,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:38,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:46:38,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:46:38,498 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:46:38,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 04:46:38,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 04:46:38,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 04:46:38,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:38,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:38,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 04:46:38,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:46:38,865 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:46:38,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:46:39,814 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:46:39,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673407915] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:46:39,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:46:39,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 4] total 15 [2025-01-09 04:46:39,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555150854] [2025-01-09 04:46:39,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:46:39,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 04:46:39,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:39,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 04:46:39,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-01-09 04:46:39,817 INFO L87 Difference]: Start difference. First operand 124528 states and 185247 transitions. Second operand has 15 states, 15 states have (on average 21.4) internal successors, (321), 15 states have internal predecessors, (321), 0 states have call successors, (0), 0 states 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:46:44,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:46:44,335 INFO L93 Difference]: Finished difference Result 719424 states and 1066155 transitions. [2025-01-09 04:46:44,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-01-09 04:46:44,336 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 21.4) internal successors, (321), 15 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-01-09 04:46:44,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:46:45,633 INFO L225 Difference]: With dead ends: 719424 [2025-01-09 04:46:45,633 INFO L226 Difference]: Without dead ends: 601182 [2025-01-09 04:46:45,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1509 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=907, Invalid=3649, Unknown=0, NotChecked=0, Total=4556 [2025-01-09 04:46:45,772 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 6451 mSDsluCounter, 2644 mSDsCounter, 0 mSdLazyCounter, 2423 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6451 SdHoareTripleChecker+Valid, 2974 SdHoareTripleChecker+Invalid, 2464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:46:45,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6451 Valid, 2974 Invalid, 2464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2423 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 04:46:46,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601182 states. [2025-01-09 04:46:52,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601182 to 461848. [2025-01-09 04:46:53,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461848 states, 461847 states have (on average 1.4746160525022356) internal successors, (681047), 461847 states have internal predecessors, (681047), 0 states have call successors, (0), 0 states 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:46:54,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461848 states to 461848 states and 681047 transitions. [2025-01-09 04:46:54,680 INFO L78 Accepts]: Start accepts. Automaton has 461848 states and 681047 transitions. Word has length 111 [2025-01-09 04:46:54,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:46:54,680 INFO L471 AbstractCegarLoop]: Abstraction has 461848 states and 681047 transitions. [2025-01-09 04:46:54,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 21.4) internal successors, (321), 15 states have internal predecessors, (321), 0 states have call successors, (0), 0 states 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:46:54,680 INFO L276 IsEmpty]: Start isEmpty. Operand 461848 states and 681047 transitions. [2025-01-09 04:46:54,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 04:46:54,766 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:46:54,766 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:46:54,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 04:46:54,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-09 04:46:54,967 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:46:54,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:46:54,969 INFO L85 PathProgramCache]: Analyzing trace with hash 160101419, now seen corresponding path program 1 times [2025-01-09 04:46:54,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:46:54,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407329644] [2025-01-09 04:46:54,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:46:54,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:46:55,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 04:46:55,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 04:46:55,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:46:55,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:46:55,169 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:46:55,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:46:55,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407329644] [2025-01-09 04:46:55,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407329644] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:46:55,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:46:55,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:46:55,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650062667] [2025-01-09 04:46:55,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:46:55,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:46:55,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:46:55,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:46:55,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:46:55,172 INFO L87 Difference]: Start difference. First operand 461848 states and 681047 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:46:59,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:46:59,020 INFO L93 Difference]: Finished difference Result 1080175 states and 1591455 transitions. [2025-01-09 04:46:59,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:46:59,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-01-09 04:46:59,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:47:00,235 INFO L225 Difference]: With dead ends: 1080175 [2025-01-09 04:47:00,236 INFO L226 Difference]: Without dead ends: 733637 [2025-01-09 04:47:01,150 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:47:01,155 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 131 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:47:01,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 493 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:47:01,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733637 states.