./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 742f5d2e7cf114f57c75e9ec70cbf1110245ef125564c2c81d93a290329b3301 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:56:28,883 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:56:28,929 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:56:28,933 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:56:28,936 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:56:28,959 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:56:28,960 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:56:28,960 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:56:28,960 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:56:28,960 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:56:28,960 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:56:28,961 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:56:28,961 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:56:28,961 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:56:28,962 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:56:28,962 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:56:28,962 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:56:28,962 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:56:28,962 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:56:28,962 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:56:28,962 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:56:28,962 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:56:28,962 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:56:28,962 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:56:28,962 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:56:28,962 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:56:28,962 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:56:28,962 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:56:28,962 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:56:28,963 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:56:28,963 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:56:28,963 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:56:28,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:56:28,963 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:56:28,963 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:56:28,963 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:56:28,963 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:56:28,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:56:28,963 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:56:28,963 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:56:28,963 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:56:28,963 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:56:28,963 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:56:28,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:56:28,963 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:56:28,963 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:56:28,963 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:56:28,963 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:56:28,963 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 -> 742f5d2e7cf114f57c75e9ec70cbf1110245ef125564c2c81d93a290329b3301 [2025-01-09 04:56:29,176 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:56:29,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:56:29,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:56:29,185 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:56:29,185 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:56:29,186 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-01-09 04:56:30,291 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af11115c9/e66d9a9215d24837bcaf8f7b57ed58d3/FLAG8d51e5443 [2025-01-09 04:56:30,622 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:56:30,625 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-01-09 04:56:30,638 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af11115c9/e66d9a9215d24837bcaf8f7b57ed58d3/FLAG8d51e5443 [2025-01-09 04:56:30,656 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af11115c9/e66d9a9215d24837bcaf8f7b57ed58d3 [2025-01-09 04:56:30,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:56:30,659 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:56:30,660 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:56:30,660 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:56:30,664 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:56:30,665 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:56:30" (1/1) ... [2025-01-09 04:56:30,666 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64bc7117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:30, skipping insertion in model container [2025-01-09 04:56:30,666 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:56:30" (1/1) ... [2025-01-09 04:56:30,710 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:56:30,896 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[15866,15879] [2025-01-09 04:56:30,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:56:30,951 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:56:31,022 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[15866,15879] [2025-01-09 04:56:31,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:56:31,060 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:56:31,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:31 WrapperNode [2025-01-09 04:56:31,061 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:56:31,061 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:56:31,062 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:56:31,062 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:56:31,066 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:56:31" (1/1) ... [2025-01-09 04:56:31,081 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:56:31" (1/1) ... [2025-01-09 04:56:31,139 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1376 [2025-01-09 04:56:31,139 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:56:31,140 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:56:31,140 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:56:31,140 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:56:31,146 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:31" (1/1) ... [2025-01-09 04:56:31,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:31" (1/1) ... [2025-01-09 04:56:31,151 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:31" (1/1) ... [2025-01-09 04:56:31,167 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:56:31,167 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:31" (1/1) ... [2025-01-09 04:56:31,167 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:31" (1/1) ... [2025-01-09 04:56:31,179 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:31" (1/1) ... [2025-01-09 04:56:31,186 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:31" (1/1) ... [2025-01-09 04:56:31,198 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:31" (1/1) ... [2025-01-09 04:56:31,203 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:31" (1/1) ... [2025-01-09 04:56:31,206 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:31" (1/1) ... [2025-01-09 04:56:31,213 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:56:31,213 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:56:31,214 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:56:31,214 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:56:31,214 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:31" (1/1) ... [2025-01-09 04:56:31,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:56:31,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:56:31,245 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:56:31,250 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:56:31,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:56:31,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:56:31,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:56:31,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:56:31,380 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:56:31,381 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:56:32,218 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2025-01-09 04:56:32,218 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:56:32,231 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:56:32,231 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:56:32,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:56:32 BoogieIcfgContainer [2025-01-09 04:56:32,232 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:56:32,233 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:56:32,233 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:56:32,238 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:56:32,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:56:30" (1/3) ... [2025-01-09 04:56:32,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40227d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:56:32, skipping insertion in model container [2025-01-09 04:56:32,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:31" (2/3) ... [2025-01-09 04:56:32,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40227d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:56:32, skipping insertion in model container [2025-01-09 04:56:32,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:56:32" (3/3) ... [2025-01-09 04:56:32,239 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-01-09 04:56:32,249 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:56:32,253 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c that has 1 procedures, 344 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 04:56:32,308 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:56:32,319 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;@7d264923, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:56:32,319 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:56:32,322 INFO L276 IsEmpty]: Start isEmpty. Operand has 344 states, 342 states have (on average 1.7690058479532165) internal successors, (605), 343 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:32,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 04:56:32,332 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:32,333 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:56:32,334 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:32,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:32,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1491324598, now seen corresponding path program 1 times [2025-01-09 04:56:32,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:32,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100111509] [2025-01-09 04:56:32,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:32,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:32,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 04:56:32,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 04:56:32,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:32,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:32,846 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:56:32,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:32,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100111509] [2025-01-09 04:56:32,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100111509] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:32,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:32,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:56:32,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063480884] [2025-01-09 04:56:32,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:32,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:56:32,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:32,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:56:32,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:56:32,871 INFO L87 Difference]: Start difference. First operand has 344 states, 342 states have (on average 1.7690058479532165) internal successors, (605), 343 states have internal predecessors, (605), 0 states have call successors, (0), 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 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:33,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:33,020 INFO L93 Difference]: Finished difference Result 702 states and 1220 transitions. [2025-01-09 04:56:33,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:56:33,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 155 [2025-01-09 04:56:33,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:33,035 INFO L225 Difference]: With dead ends: 702 [2025-01-09 04:56:33,036 INFO L226 Difference]: Without dead ends: 565 [2025-01-09 04:56:33,039 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:56:33,040 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 418 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:33,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1007 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:56:33,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2025-01-09 04:56:33,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 563. [2025-01-09 04:56:33,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 562 states have (on average 1.498220640569395) internal successors, (842), 562 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:33,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 842 transitions. [2025-01-09 04:56:33,100 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 842 transitions. Word has length 155 [2025-01-09 04:56:33,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:33,100 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 842 transitions. [2025-01-09 04:56:33,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:33,101 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 842 transitions. [2025-01-09 04:56:33,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 04:56:33,103 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:33,103 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:56:33,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:56:33,105 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:33,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:33,105 INFO L85 PathProgramCache]: Analyzing trace with hash -599043347, now seen corresponding path program 1 times [2025-01-09 04:56:33,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:33,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260736619] [2025-01-09 04:56:33,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:33,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:33,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 04:56:33,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 04:56:33,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:33,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:33,688 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:56:33,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:33,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260736619] [2025-01-09 04:56:33,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260736619] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:33,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:33,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:56:33,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510467321] [2025-01-09 04:56:33,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:33,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:56:33,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:33,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:56:33,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:56:33,694 INFO L87 Difference]: Start difference. First operand 563 states and 842 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:33,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:33,825 INFO L93 Difference]: Finished difference Result 2720 states and 4051 transitions. [2025-01-09 04:56:33,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:56:33,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 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 155 [2025-01-09 04:56:33,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:33,832 INFO L225 Difference]: With dead ends: 2720 [2025-01-09 04:56:33,833 INFO L226 Difference]: Without dead ends: 2166 [2025-01-09 04:56:33,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:56:33,837 INFO L435 NwaCegarLoop]: 787 mSDtfsCounter, 1518 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1518 SdHoareTripleChecker+Valid, 2098 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:33,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1518 Valid, 2098 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:56:33,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2166 states. [2025-01-09 04:56:33,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2166 to 1087. [2025-01-09 04:56:33,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1087 states, 1086 states have (on average 1.4806629834254144) internal successors, (1608), 1086 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:33,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1608 transitions. [2025-01-09 04:56:33,885 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1608 transitions. Word has length 155 [2025-01-09 04:56:33,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:33,885 INFO L471 AbstractCegarLoop]: Abstraction has 1087 states and 1608 transitions. [2025-01-09 04:56:33,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:33,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1608 transitions. [2025-01-09 04:56:33,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 04:56:33,891 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:33,891 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:56:33,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:56:33,891 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:33,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:33,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1611010681, now seen corresponding path program 1 times [2025-01-09 04:56:33,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:33,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706352940] [2025-01-09 04:56:33,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:33,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:33,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 04:56:33,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 04:56:33,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:33,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:34,010 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:56:34,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:34,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706352940] [2025-01-09 04:56:34,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706352940] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:34,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:34,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:56:34,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646485435] [2025-01-09 04:56:34,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:34,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:56:34,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:34,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:56:34,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:56:34,012 INFO L87 Difference]: Start difference. First operand 1087 states and 1608 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:34,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:34,039 INFO L93 Difference]: Finished difference Result 2148 states and 3173 transitions. [2025-01-09 04:56:34,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:56:34,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2025-01-09 04:56:34,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:34,043 INFO L225 Difference]: With dead ends: 2148 [2025-01-09 04:56:34,044 INFO L226 Difference]: Without dead ends: 1089 [2025-01-09 04:56:34,045 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:56:34,045 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 0 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:34,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1002 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:56:34,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2025-01-09 04:56:34,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1089. [2025-01-09 04:56:34,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1089 states, 1088 states have (on average 1.4797794117647058) internal successors, (1610), 1088 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:34,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1610 transitions. [2025-01-09 04:56:34,073 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1610 transitions. Word has length 156 [2025-01-09 04:56:34,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:34,073 INFO L471 AbstractCegarLoop]: Abstraction has 1089 states and 1610 transitions. [2025-01-09 04:56:34,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:34,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1610 transitions. [2025-01-09 04:56:34,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 04:56:34,076 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:34,076 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:56:34,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:56:34,077 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:34,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:34,077 INFO L85 PathProgramCache]: Analyzing trace with hash -580833396, now seen corresponding path program 1 times [2025-01-09 04:56:34,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:34,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362674182] [2025-01-09 04:56:34,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:34,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:34,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 04:56:34,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 04:56:34,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:34,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:34,494 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:56:34,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:34,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362674182] [2025-01-09 04:56:34,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362674182] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:34,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:34,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:56:34,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731318590] [2025-01-09 04:56:34,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:34,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:56:34,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:34,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:56:34,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:56:34,496 INFO L87 Difference]: Start difference. First operand 1089 states and 1610 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:34,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:34,525 INFO L93 Difference]: Finished difference Result 2168 states and 3206 transitions. [2025-01-09 04:56:34,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:56:34,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 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 157 [2025-01-09 04:56:34,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:34,530 INFO L225 Difference]: With dead ends: 2168 [2025-01-09 04:56:34,530 INFO L226 Difference]: Without dead ends: 1087 [2025-01-09 04:56:34,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:56:34,534 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 24 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:34,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1584 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:56:34,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2025-01-09 04:56:34,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 1087. [2025-01-09 04:56:34,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1087 states, 1086 states have (on average 1.4788213627992635) internal successors, (1606), 1086 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:34,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1606 transitions. [2025-01-09 04:56:34,559 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1606 transitions. Word has length 157 [2025-01-09 04:56:34,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:34,559 INFO L471 AbstractCegarLoop]: Abstraction has 1087 states and 1606 transitions. [2025-01-09 04:56:34,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:34,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1606 transitions. [2025-01-09 04:56:34,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 04:56:34,562 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:34,562 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:56:34,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:56:34,562 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:34,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:34,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1083671628, now seen corresponding path program 1 times [2025-01-09 04:56:34,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:34,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139133862] [2025-01-09 04:56:34,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:34,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:34,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 04:56:34,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 04:56:34,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:34,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:34,667 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:56:34,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:34,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139133862] [2025-01-09 04:56:34,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139133862] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:34,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:34,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:56:34,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013696326] [2025-01-09 04:56:34,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:34,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:56:34,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:34,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:56:34,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:56:34,669 INFO L87 Difference]: Start difference. First operand 1087 states and 1606 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:34,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:34,711 INFO L93 Difference]: Finished difference Result 2507 states and 3714 transitions. [2025-01-09 04:56:34,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:56:34,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 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 157 [2025-01-09 04:56:34,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:34,716 INFO L225 Difference]: With dead ends: 2507 [2025-01-09 04:56:34,716 INFO L226 Difference]: Without dead ends: 1611 [2025-01-09 04:56:34,717 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:56:34,718 INFO L435 NwaCegarLoop]: 946 mSDtfsCounter, 428 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:34,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 1394 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:56:34,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2025-01-09 04:56:34,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1609. [2025-01-09 04:56:34,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 1608 states have (on average 1.4601990049751243) internal successors, (2348), 1608 states have internal predecessors, (2348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:34,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2348 transitions. [2025-01-09 04:56:34,747 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2348 transitions. Word has length 157 [2025-01-09 04:56:34,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:34,747 INFO L471 AbstractCegarLoop]: Abstraction has 1609 states and 2348 transitions. [2025-01-09 04:56:34,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:34,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2348 transitions. [2025-01-09 04:56:34,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-09 04:56:34,749 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:34,750 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:56:34,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:56:34,750 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:34,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:34,750 INFO L85 PathProgramCache]: Analyzing trace with hash 752375599, now seen corresponding path program 1 times [2025-01-09 04:56:34,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:34,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843620405] [2025-01-09 04:56:34,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:34,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:34,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 04:56:34,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 04:56:34,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:34,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:34,822 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:56:34,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:34,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843620405] [2025-01-09 04:56:34,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843620405] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:34,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:34,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:56:34,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989765483] [2025-01-09 04:56:34,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:34,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:56:34,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:34,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:56:34,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:56:34,824 INFO L87 Difference]: Start difference. First operand 1609 states and 2348 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:34,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:34,874 INFO L93 Difference]: Finished difference Result 3806 states and 5670 transitions. [2025-01-09 04:56:34,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:56:34,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 159 [2025-01-09 04:56:34,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:34,882 INFO L225 Difference]: With dead ends: 3806 [2025-01-09 04:56:34,882 INFO L226 Difference]: Without dead ends: 2379 [2025-01-09 04:56:34,884 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:56:34,884 INFO L435 NwaCegarLoop]: 705 mSDtfsCounter, 315 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:34,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 1075 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:56:34,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2379 states. [2025-01-09 04:56:34,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2379 to 2051. [2025-01-09 04:56:34,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2051 states, 2050 states have (on average 1.4970731707317073) internal successors, (3069), 2050 states have internal predecessors, (3069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:34,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 2051 states and 3069 transitions. [2025-01-09 04:56:34,931 INFO L78 Accepts]: Start accepts. Automaton has 2051 states and 3069 transitions. Word has length 159 [2025-01-09 04:56:34,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:34,931 INFO L471 AbstractCegarLoop]: Abstraction has 2051 states and 3069 transitions. [2025-01-09 04:56:34,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:34,931 INFO L276 IsEmpty]: Start isEmpty. Operand 2051 states and 3069 transitions. [2025-01-09 04:56:34,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 04:56:34,934 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:34,934 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:56:34,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:56:34,934 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:34,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:34,935 INFO L85 PathProgramCache]: Analyzing trace with hash -2060170337, now seen corresponding path program 1 times [2025-01-09 04:56:34,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:34,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294481250] [2025-01-09 04:56:34,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:34,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:34,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 04:56:34,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 04:56:34,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:34,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:35,015 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:56:35,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:35,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294481250] [2025-01-09 04:56:35,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294481250] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:35,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:35,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:56:35,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749297932] [2025-01-09 04:56:35,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:35,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:56:35,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:35,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:56:35,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:56:35,018 INFO L87 Difference]: Start difference. First operand 2051 states and 3069 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:35,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:35,072 INFO L93 Difference]: Finished difference Result 4930 states and 7515 transitions. [2025-01-09 04:56:35,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:56:35,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2025-01-09 04:56:35,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:35,082 INFO L225 Difference]: With dead ends: 4930 [2025-01-09 04:56:35,082 INFO L226 Difference]: Without dead ends: 3145 [2025-01-09 04:56:35,085 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:56:35,085 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 310 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:35,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 1035 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:56:35,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3145 states. [2025-01-09 04:56:35,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3145 to 2829. [2025-01-09 04:56:35,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2829 states, 2828 states have (on average 1.5307637906647809) internal successors, (4329), 2828 states have internal predecessors, (4329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:35,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2829 states to 2829 states and 4329 transitions. [2025-01-09 04:56:35,152 INFO L78 Accepts]: Start accepts. Automaton has 2829 states and 4329 transitions. Word has length 161 [2025-01-09 04:56:35,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:35,152 INFO L471 AbstractCegarLoop]: Abstraction has 2829 states and 4329 transitions. [2025-01-09 04:56:35,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:35,152 INFO L276 IsEmpty]: Start isEmpty. Operand 2829 states and 4329 transitions. [2025-01-09 04:56:35,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 04:56:35,155 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:35,155 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:56:35,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:56:35,155 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:35,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:35,155 INFO L85 PathProgramCache]: Analyzing trace with hash -835873379, now seen corresponding path program 1 times [2025-01-09 04:56:35,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:35,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578856333] [2025-01-09 04:56:35,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:35,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:35,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 04:56:35,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 04:56:35,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:35,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:35,342 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:56:35,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:35,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578856333] [2025-01-09 04:56:35,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578856333] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:35,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:35,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:56:35,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66284952] [2025-01-09 04:56:35,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:35,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:56:35,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:35,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:56:35,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:56:35,344 INFO L87 Difference]: Start difference. First operand 2829 states and 4329 transitions. Second operand has 5 states, 5 states have (on average 32.4) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:35,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:35,492 INFO L93 Difference]: Finished difference Result 5482 states and 8434 transitions. [2025-01-09 04:56:35,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:56:35,492 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2025-01-09 04:56:35,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:35,501 INFO L225 Difference]: With dead ends: 5482 [2025-01-09 04:56:35,501 INFO L226 Difference]: Without dead ends: 2829 [2025-01-09 04:56:35,504 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:56:35,505 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 1316 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1316 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:35,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1316 Valid, 480 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:56:35,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2829 states. [2025-01-09 04:56:35,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2829 to 2829. [2025-01-09 04:56:35,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2829 states, 2828 states have (on average 1.5183875530410185) internal successors, (4294), 2828 states have internal predecessors, (4294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:35,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2829 states to 2829 states and 4294 transitions. [2025-01-09 04:56:35,571 INFO L78 Accepts]: Start accepts. Automaton has 2829 states and 4294 transitions. Word has length 162 [2025-01-09 04:56:35,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:35,571 INFO L471 AbstractCegarLoop]: Abstraction has 2829 states and 4294 transitions. [2025-01-09 04:56:35,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:35,573 INFO L276 IsEmpty]: Start isEmpty. Operand 2829 states and 4294 transitions. [2025-01-09 04:56:35,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 04:56:35,576 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:35,576 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:56:35,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:56:35,576 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:35,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:35,576 INFO L85 PathProgramCache]: Analyzing trace with hash -305345160, now seen corresponding path program 1 times [2025-01-09 04:56:35,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:35,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657961600] [2025-01-09 04:56:35,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:35,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:35,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 04:56:35,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 04:56:35,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:35,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:35,937 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:56:35,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:35,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657961600] [2025-01-09 04:56:35,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657961600] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:35,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:35,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:56:35,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298348036] [2025-01-09 04:56:35,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:35,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:56:35,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:35,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:56:35,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:56:35,940 INFO L87 Difference]: Start difference. First operand 2829 states and 4294 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:36,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:36,067 INFO L93 Difference]: Finished difference Result 7157 states and 11133 transitions. [2025-01-09 04:56:36,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:56:36,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2025-01-09 04:56:36,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:36,081 INFO L225 Difference]: With dead ends: 7157 [2025-01-09 04:56:36,081 INFO L226 Difference]: Without dead ends: 5281 [2025-01-09 04:56:36,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:56:36,084 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 628 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:36,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 965 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:56:36,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5281 states. [2025-01-09 04:56:36,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5281 to 5279. [2025-01-09 04:56:36,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5279 states, 5278 states have (on average 1.528419856006063) internal successors, (8067), 5278 states have internal predecessors, (8067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:36,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5279 states to 5279 states and 8067 transitions. [2025-01-09 04:56:36,180 INFO L78 Accepts]: Start accepts. Automaton has 5279 states and 8067 transitions. Word has length 162 [2025-01-09 04:56:36,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:36,180 INFO L471 AbstractCegarLoop]: Abstraction has 5279 states and 8067 transitions. [2025-01-09 04:56:36,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:36,180 INFO L276 IsEmpty]: Start isEmpty. Operand 5279 states and 8067 transitions. [2025-01-09 04:56:36,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 04:56:36,183 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:36,183 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:56:36,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:56:36,184 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:36,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:36,184 INFO L85 PathProgramCache]: Analyzing trace with hash 116042600, now seen corresponding path program 1 times [2025-01-09 04:56:36,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:36,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871164339] [2025-01-09 04:56:36,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:36,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:36,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 04:56:36,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 04:56:36,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:36,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:36,328 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:56:36,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:36,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871164339] [2025-01-09 04:56:36,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871164339] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:36,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:36,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:56:36,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448093730] [2025-01-09 04:56:36,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:36,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:56:36,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:36,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:56:36,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:56:36,330 INFO L87 Difference]: Start difference. First operand 5279 states and 8067 transitions. Second operand has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:36,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:36,491 INFO L93 Difference]: Finished difference Result 14009 states and 22185 transitions. [2025-01-09 04:56:36,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:56:36,492 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2025-01-09 04:56:36,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:36,520 INFO L225 Difference]: With dead ends: 14009 [2025-01-09 04:56:36,520 INFO L226 Difference]: Without dead ends: 12268 [2025-01-09 04:56:36,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:56:36,527 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 1119 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1119 SdHoareTripleChecker+Valid, 1490 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:36,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1119 Valid, 1490 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:56:36,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12268 states. [2025-01-09 04:56:36,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12268 to 8790. [2025-01-09 04:56:36,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8790 states, 8789 states have (on average 1.5597906474001593) internal successors, (13709), 8789 states have internal predecessors, (13709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:36,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8790 states to 8790 states and 13709 transitions. [2025-01-09 04:56:36,766 INFO L78 Accepts]: Start accepts. Automaton has 8790 states and 13709 transitions. Word has length 162 [2025-01-09 04:56:36,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:36,766 INFO L471 AbstractCegarLoop]: Abstraction has 8790 states and 13709 transitions. [2025-01-09 04:56:36,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:36,766 INFO L276 IsEmpty]: Start isEmpty. Operand 8790 states and 13709 transitions. [2025-01-09 04:56:36,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 04:56:36,770 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:36,770 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:56:36,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:56:36,770 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:36,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:36,771 INFO L85 PathProgramCache]: Analyzing trace with hash 948244203, now seen corresponding path program 1 times [2025-01-09 04:56:36,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:36,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182944709] [2025-01-09 04:56:36,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:36,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:36,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 04:56:36,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 04:56:36,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:36,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:36,875 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:56:36,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:36,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182944709] [2025-01-09 04:56:36,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182944709] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:36,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:36,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:56:36,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812870029] [2025-01-09 04:56:36,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:36,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:56:36,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:36,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:56:36,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:56:36,877 INFO L87 Difference]: Start difference. First operand 8790 states and 13709 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:36,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:36,992 INFO L93 Difference]: Finished difference Result 22407 states and 35348 transitions. [2025-01-09 04:56:36,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:56:36,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2025-01-09 04:56:36,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:37,022 INFO L225 Difference]: With dead ends: 22407 [2025-01-09 04:56:37,023 INFO L226 Difference]: Without dead ends: 15305 [2025-01-09 04:56:37,036 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:56:37,037 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 300 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:37,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 801 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:56:37,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15305 states. [2025-01-09 04:56:37,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15305 to 15303. [2025-01-09 04:56:37,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15303 states, 15302 states have (on average 1.5583583845248987) internal successors, (23846), 15302 states have internal predecessors, (23846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:37,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15303 states to 15303 states and 23846 transitions. [2025-01-09 04:56:37,302 INFO L78 Accepts]: Start accepts. Automaton has 15303 states and 23846 transitions. Word has length 162 [2025-01-09 04:56:37,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:37,303 INFO L471 AbstractCegarLoop]: Abstraction has 15303 states and 23846 transitions. [2025-01-09 04:56:37,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:37,303 INFO L276 IsEmpty]: Start isEmpty. Operand 15303 states and 23846 transitions. [2025-01-09 04:56:37,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 04:56:37,308 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:37,308 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:56:37,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:56:37,308 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:37,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:37,309 INFO L85 PathProgramCache]: Analyzing trace with hash 261834227, now seen corresponding path program 1 times [2025-01-09 04:56:37,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:37,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625302442] [2025-01-09 04:56:37,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:37,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:37,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 04:56:37,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 04:56:37,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:37,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:37,612 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:56:37,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:37,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625302442] [2025-01-09 04:56:37,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625302442] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:37,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:37,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:56:37,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575627462] [2025-01-09 04:56:37,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:37,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:56:37,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:37,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:56:37,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:56:37,615 INFO L87 Difference]: Start difference. First operand 15303 states and 23846 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:37,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:37,725 INFO L93 Difference]: Finished difference Result 40246 states and 62732 transitions. [2025-01-09 04:56:37,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:56:37,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2025-01-09 04:56:37,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:37,777 INFO L225 Difference]: With dead ends: 40246 [2025-01-09 04:56:37,777 INFO L226 Difference]: Without dead ends: 24980 [2025-01-09 04:56:37,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:56:37,800 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 853 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:37,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 1294 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:56:37,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24980 states. [2025-01-09 04:56:38,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24980 to 24978. [2025-01-09 04:56:38,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24978 states, 24977 states have (on average 1.5459022300516476) internal successors, (38612), 24977 states have internal predecessors, (38612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:38,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24978 states to 24978 states and 38612 transitions. [2025-01-09 04:56:38,255 INFO L78 Accepts]: Start accepts. Automaton has 24978 states and 38612 transitions. Word has length 162 [2025-01-09 04:56:38,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:38,255 INFO L471 AbstractCegarLoop]: Abstraction has 24978 states and 38612 transitions. [2025-01-09 04:56:38,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:38,255 INFO L276 IsEmpty]: Start isEmpty. Operand 24978 states and 38612 transitions. [2025-01-09 04:56:38,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 04:56:38,262 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:38,263 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:56:38,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:56:38,263 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:38,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:38,264 INFO L85 PathProgramCache]: Analyzing trace with hash -934455746, now seen corresponding path program 1 times [2025-01-09 04:56:38,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:38,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283982401] [2025-01-09 04:56:38,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:38,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:38,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 04:56:38,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 04:56:38,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:38,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:38,336 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:56:38,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:38,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283982401] [2025-01-09 04:56:38,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283982401] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:38,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:38,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:56:38,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193907022] [2025-01-09 04:56:38,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:38,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:56:38,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:38,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:56:38,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:56:38,338 INFO L87 Difference]: Start difference. First operand 24978 states and 38612 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:38,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:38,479 INFO L93 Difference]: Finished difference Result 67730 states and 104516 transitions. [2025-01-09 04:56:38,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:56:38,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2025-01-09 04:56:38,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:38,558 INFO L225 Difference]: With dead ends: 67730 [2025-01-09 04:56:38,558 INFO L226 Difference]: Without dead ends: 43152 [2025-01-09 04:56:38,595 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:56:38,597 INFO L435 NwaCegarLoop]: 908 mSDtfsCounter, 413 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 1353 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:38,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 1353 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:56:38,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43152 states. [2025-01-09 04:56:39,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43152 to 43150. [2025-01-09 04:56:39,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43150 states, 43149 states have (on average 1.5270574057336208) internal successors, (65891), 43149 states have internal predecessors, (65891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:39,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43150 states to 43150 states and 65891 transitions. [2025-01-09 04:56:39,433 INFO L78 Accepts]: Start accepts. Automaton has 43150 states and 65891 transitions. Word has length 164 [2025-01-09 04:56:39,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:39,434 INFO L471 AbstractCegarLoop]: Abstraction has 43150 states and 65891 transitions. [2025-01-09 04:56:39,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:39,434 INFO L276 IsEmpty]: Start isEmpty. Operand 43150 states and 65891 transitions. [2025-01-09 04:56:39,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 04:56:39,449 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:39,449 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:56:39,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:56:39,449 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:39,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:39,450 INFO L85 PathProgramCache]: Analyzing trace with hash -2079815397, now seen corresponding path program 1 times [2025-01-09 04:56:39,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:39,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92461570] [2025-01-09 04:56:39,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:39,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:39,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 04:56:39,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 04:56:39,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:39,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:39,748 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:56:39,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:39,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92461570] [2025-01-09 04:56:39,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92461570] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:39,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:39,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:56:39,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683573902] [2025-01-09 04:56:39,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:39,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:56:39,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:39,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:56:39,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:56:39,750 INFO L87 Difference]: Start difference. First operand 43150 states and 65891 transitions. Second operand has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:40,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:40,400 INFO L93 Difference]: Finished difference Result 208923 states and 318317 transitions. [2025-01-09 04:56:40,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:56:40,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2025-01-09 04:56:40,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:40,951 INFO L225 Difference]: With dead ends: 208923 [2025-01-09 04:56:40,952 INFO L226 Difference]: Without dead ends: 165838 [2025-01-09 04:56:40,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:56:40,980 INFO L435 NwaCegarLoop]: 783 mSDtfsCounter, 1410 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1410 SdHoareTripleChecker+Valid, 2029 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:40,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1410 Valid, 2029 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:56:41,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165838 states. [2025-01-09 04:56:42,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165838 to 82981. [2025-01-09 04:56:42,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82981 states, 82980 states have (on average 1.5116775126536515) internal successors, (125439), 82980 states have internal predecessors, (125439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:42,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82981 states to 82981 states and 125439 transitions. [2025-01-09 04:56:42,744 INFO L78 Accepts]: Start accepts. Automaton has 82981 states and 125439 transitions. Word has length 164 [2025-01-09 04:56:42,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:42,744 INFO L471 AbstractCegarLoop]: Abstraction has 82981 states and 125439 transitions. [2025-01-09 04:56:42,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:42,745 INFO L276 IsEmpty]: Start isEmpty. Operand 82981 states and 125439 transitions. [2025-01-09 04:56:42,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 04:56:42,769 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:42,770 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:56:42,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:56:42,770 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:42,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:42,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1326958847, now seen corresponding path program 1 times [2025-01-09 04:56:42,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:42,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954337183] [2025-01-09 04:56:42,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:42,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:42,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 04:56:42,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 04:56:42,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:42,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:42,833 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:56:42,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:42,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954337183] [2025-01-09 04:56:42,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954337183] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:42,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:42,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:56:42,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594513165] [2025-01-09 04:56:42,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:42,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:56:42,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:42,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:56:42,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:56:42,835 INFO L87 Difference]: Start difference. First operand 82981 states and 125439 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:43,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:43,180 INFO L93 Difference]: Finished difference Result 165822 states and 250683 transitions. [2025-01-09 04:56:43,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:56:43,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2025-01-09 04:56:43,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:43,319 INFO L225 Difference]: With dead ends: 165822 [2025-01-09 04:56:43,320 INFO L226 Difference]: Without dead ends: 82993 [2025-01-09 04:56:43,390 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:56:43,391 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 0 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:43,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 978 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:56:43,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82993 states. [2025-01-09 04:56:44,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82993 to 82993. [2025-01-09 04:56:44,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82993 states, 82992 states have (on average 1.5116035280508964) internal successors, (125451), 82992 states have internal predecessors, (125451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:44,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82993 states to 82993 states and 125451 transitions. [2025-01-09 04:56:44,817 INFO L78 Accepts]: Start accepts. Automaton has 82993 states and 125451 transitions. Word has length 165 [2025-01-09 04:56:44,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:44,818 INFO L471 AbstractCegarLoop]: Abstraction has 82993 states and 125451 transitions. [2025-01-09 04:56:44,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:44,818 INFO L276 IsEmpty]: Start isEmpty. Operand 82993 states and 125451 transitions. [2025-01-09 04:56:44,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 04:56:44,836 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:44,836 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:56:44,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:56:44,837 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:44,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:44,837 INFO L85 PathProgramCache]: Analyzing trace with hash -315631784, now seen corresponding path program 1 times [2025-01-09 04:56:44,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:44,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157060379] [2025-01-09 04:56:44,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:44,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:45,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 04:56:45,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 04:56:45,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:45,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:45,122 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:56:45,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:45,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157060379] [2025-01-09 04:56:45,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157060379] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:45,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:45,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:56:45,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294646236] [2025-01-09 04:56:45,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:45,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:56:45,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:45,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:56:45,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:56:45,123 INFO L87 Difference]: Start difference. First operand 82993 states and 125451 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:45,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:45,854 INFO L93 Difference]: Finished difference Result 216481 states and 326386 transitions. [2025-01-09 04:56:45,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:56:45,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2025-01-09 04:56:45,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:46,047 INFO L225 Difference]: With dead ends: 216481 [2025-01-09 04:56:46,047 INFO L226 Difference]: Without dead ends: 134545 [2025-01-09 04:56:46,086 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:56:46,087 INFO L435 NwaCegarLoop]: 918 mSDtfsCounter, 405 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:46,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 1364 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:56:46,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134545 states. [2025-01-09 04:56:47,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134545 to 134543. [2025-01-09 04:56:47,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134543 states, 134542 states have (on average 1.48955716430557) internal successors, (200408), 134542 states have internal predecessors, (200408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:48,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134543 states to 134543 states and 200408 transitions. [2025-01-09 04:56:48,094 INFO L78 Accepts]: Start accepts. Automaton has 134543 states and 200408 transitions. Word has length 166 [2025-01-09 04:56:48,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:48,095 INFO L471 AbstractCegarLoop]: Abstraction has 134543 states and 200408 transitions. [2025-01-09 04:56:48,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:48,095 INFO L276 IsEmpty]: Start isEmpty. Operand 134543 states and 200408 transitions. [2025-01-09 04:56:48,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 04:56:48,125 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:48,126 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:56:48,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:56:48,126 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:48,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:48,126 INFO L85 PathProgramCache]: Analyzing trace with hash -991683211, now seen corresponding path program 1 times [2025-01-09 04:56:48,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:48,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975399037] [2025-01-09 04:56:48,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:48,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:48,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 04:56:48,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 04:56:48,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:48,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:48,674 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:56:48,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:48,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975399037] [2025-01-09 04:56:48,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975399037] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:48,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:48,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:56:48,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807670781] [2025-01-09 04:56:48,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:48,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:56:48,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:48,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:56:48,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:56:48,676 INFO L87 Difference]: Start difference. First operand 134543 states and 200408 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:49,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:49,524 INFO L93 Difference]: Finished difference Result 251628 states and 375084 transitions. [2025-01-09 04:56:49,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:56:49,524 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2025-01-09 04:56:49,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:49,705 INFO L225 Difference]: With dead ends: 251628 [2025-01-09 04:56:49,705 INFO L226 Difference]: Without dead ends: 118050 [2025-01-09 04:56:49,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:56:49,779 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 15 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1526 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:49,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1526 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:56:49,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118050 states. [2025-01-09 04:56:51,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118050 to 118050. [2025-01-09 04:56:51,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118050 states, 118049 states have (on average 1.4893815280095553) internal successors, (175820), 118049 states have internal predecessors, (175820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:51,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118050 states to 118050 states and 175820 transitions. [2025-01-09 04:56:51,454 INFO L78 Accepts]: Start accepts. Automaton has 118050 states and 175820 transitions. Word has length 166 [2025-01-09 04:56:51,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:51,454 INFO L471 AbstractCegarLoop]: Abstraction has 118050 states and 175820 transitions. [2025-01-09 04:56:51,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:51,455 INFO L276 IsEmpty]: Start isEmpty. Operand 118050 states and 175820 transitions. [2025-01-09 04:56:51,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 04:56:51,480 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:51,480 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:56:51,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:56:51,480 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:51,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:51,481 INFO L85 PathProgramCache]: Analyzing trace with hash 2008150535, now seen corresponding path program 1 times [2025-01-09 04:56:51,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:51,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736532853] [2025-01-09 04:56:51,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:51,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:51,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 04:56:51,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 04:56:51,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:51,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:51,559 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:56:51,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:51,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736532853] [2025-01-09 04:56:51,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736532853] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:51,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:51,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:56:51,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649503501] [2025-01-09 04:56:51,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:51,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:56:51,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:51,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:56:51,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:56:51,561 INFO L87 Difference]: Start difference. First operand 118050 states and 175820 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:52,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:52,678 INFO L93 Difference]: Finished difference Result 294982 states and 442715 transitions. [2025-01-09 04:56:52,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:56:52,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2025-01-09 04:56:52,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:52,982 INFO L225 Difference]: With dead ends: 294982 [2025-01-09 04:56:52,983 INFO L226 Difference]: Without dead ends: 194812 [2025-01-09 04:56:53,084 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:56:53,084 INFO L435 NwaCegarLoop]: 683 mSDtfsCounter, 302 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:53,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 1036 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:56:53,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194812 states. [2025-01-09 04:56:55,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194812 to 179926. [2025-01-09 04:56:55,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179926 states, 179925 states have (on average 1.5084952063359733) internal successors, (271416), 179925 states have internal predecessors, (271416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:56,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179926 states to 179926 states and 271416 transitions. [2025-01-09 04:56:56,370 INFO L78 Accepts]: Start accepts. Automaton has 179926 states and 271416 transitions. Word has length 168 [2025-01-09 04:56:56,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:56,370 INFO L471 AbstractCegarLoop]: Abstraction has 179926 states and 271416 transitions. [2025-01-09 04:56:56,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:56,371 INFO L276 IsEmpty]: Start isEmpty. Operand 179926 states and 271416 transitions. [2025-01-09 04:56:56,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 04:56:56,412 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:56,412 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:56:56,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:56:56,412 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:56,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:56,413 INFO L85 PathProgramCache]: Analyzing trace with hash 681312356, now seen corresponding path program 1 times [2025-01-09 04:56:56,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:56,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747759989] [2025-01-09 04:56:56,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:56,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:56,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 04:56:56,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 04:56:56,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:56,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:56,630 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:56:56,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:56,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747759989] [2025-01-09 04:56:56,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747759989] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:56,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:56,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:56:56,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388993032] [2025-01-09 04:56:56,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:56,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:56:56,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:56,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:56:56,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:56:56,632 INFO L87 Difference]: Start difference. First operand 179926 states and 271416 transitions. Second operand has 8 states, 8 states have (on average 21.375) internal successors, (171), 7 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:58,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:58,916 INFO L93 Difference]: Finished difference Result 615344 states and 928642 transitions. [2025-01-09 04:56:58,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:56:58,916 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.375) internal successors, (171), 7 states have internal predecessors, (171), 0 states have call successors, (0), 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 171 [2025-01-09 04:56:58,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:59,849 INFO L225 Difference]: With dead ends: 615344 [2025-01-09 04:56:59,850 INFO L226 Difference]: Without dead ends: 499600 [2025-01-09 04:57:00,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2025-01-09 04:57:00,015 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 5553 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5553 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:57:00,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5553 Valid, 1228 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:57:00,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499600 states. [2025-01-09 04:57:04,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499600 to 217404. [2025-01-09 04:57:04,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217404 states, 217403 states have (on average 1.5149652948671362) internal successors, (329358), 217403 states have internal predecessors, (329358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:57:05,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217404 states to 217404 states and 329358 transitions. [2025-01-09 04:57:05,663 INFO L78 Accepts]: Start accepts. Automaton has 217404 states and 329358 transitions. Word has length 171 [2025-01-09 04:57:05,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:57:05,663 INFO L471 AbstractCegarLoop]: Abstraction has 217404 states and 329358 transitions. [2025-01-09 04:57:05,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.375) internal successors, (171), 7 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:57:05,663 INFO L276 IsEmpty]: Start isEmpty. Operand 217404 states and 329358 transitions. [2025-01-09 04:57:05,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 04:57:05,683 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:57:05,683 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:57:05,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:57:05,684 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:57:05,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:57:05,684 INFO L85 PathProgramCache]: Analyzing trace with hash -188106696, now seen corresponding path program 1 times [2025-01-09 04:57:05,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:57:05,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727032901] [2025-01-09 04:57:05,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:57:05,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:57:05,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 04:57:05,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 04:57:05,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:57:05,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:57:05,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:57:05,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:57:05,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727032901] [2025-01-09 04:57:05,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727032901] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:57:05,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:57:05,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:57:05,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903797775] [2025-01-09 04:57:05,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:57:05,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:57:05,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:57:05,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:57:05,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:57:05,962 INFO L87 Difference]: Start difference. First operand 217404 states and 329358 transitions. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:57:07,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:57:07,456 INFO L93 Difference]: Finished difference Result 415721 states and 629889 transitions. [2025-01-09 04:57:07,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:57:07,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 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 171 [2025-01-09 04:57:07,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:57:07,802 INFO L225 Difference]: With dead ends: 415721 [2025-01-09 04:57:07,803 INFO L226 Difference]: Without dead ends: 198912 [2025-01-09 04:57:07,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:57:07,942 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 18 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1524 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:57:07,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1524 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:57:08,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198912 states. [2025-01-09 04:57:10,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198912 to 198912. [2025-01-09 04:57:10,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198912 states, 198911 states have (on average 1.5143204749863004) internal successors, (301215), 198911 states have internal predecessors, (301215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:57:10,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198912 states to 198912 states and 301215 transitions. [2025-01-09 04:57:10,886 INFO L78 Accepts]: Start accepts. Automaton has 198912 states and 301215 transitions. Word has length 171 [2025-01-09 04:57:10,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:57:10,886 INFO L471 AbstractCegarLoop]: Abstraction has 198912 states and 301215 transitions. [2025-01-09 04:57:10,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:57:10,886 INFO L276 IsEmpty]: Start isEmpty. Operand 198912 states and 301215 transitions. [2025-01-09 04:57:10,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 04:57:10,903 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:57:10,904 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:57:10,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:57:10,904 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:57:10,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:57:10,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1144596849, now seen corresponding path program 1 times [2025-01-09 04:57:10,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:57:10,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618052733] [2025-01-09 04:57:10,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:57:10,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:57:10,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 04:57:10,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 04:57:10,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:57:10,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:57:11,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:57:11,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:57:11,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618052733] [2025-01-09 04:57:11,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618052733] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:57:11,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:57:11,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:57:11,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867680196] [2025-01-09 04:57:11,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:57:11,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:57:11,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:57:11,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:57:11,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:57:11,022 INFO L87 Difference]: Start difference. First operand 198912 states and 301215 transitions. Second operand has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)