./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.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_lcr.5.1.ufo.BOUNDED-10.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 e7bf678f67bc088f549a4abb07f450d970cef489f8318e3fb7c3771679b9e87b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:50:20,021 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:50:20,079 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:50:20,084 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:50:20,088 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:50:20,119 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:50:20,124 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:50:20,124 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:50:20,124 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:50:20,124 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:50:20,124 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:50:20,124 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:50:20,124 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:50:20,125 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:50:20,125 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:50:20,125 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:50:20,125 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:50:20,125 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:50:20,125 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:50:20,125 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:50:20,125 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:50:20,125 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:50:20,125 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:50:20,125 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:50:20,125 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:50:20,125 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:50:20,125 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:50:20,125 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:50:20,125 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:50:20,125 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:50:20,125 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:50:20,125 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:50:20,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:50:20,126 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:50:20,126 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:50:20,126 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:50:20,126 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:50:20,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:50:20,126 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:50:20,126 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:50:20,126 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:50:20,126 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:50:20,126 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:50:20,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:50:20,126 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:50:20,126 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:50:20,126 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:50:20,126 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:50:20,126 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 -> e7bf678f67bc088f549a4abb07f450d970cef489f8318e3fb7c3771679b9e87b [2025-01-09 04:50:20,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:50:20,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:50:20,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:50:20,508 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:50:20,508 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:50:20,509 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2025-01-09 04:50:21,146 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ac338c38c/9c19a02a12b449fdb18546e83141238b/FLAGacd3ce31c [2025-01-09 04:50:22,994 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:50:22,994 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2025-01-09 04:50:23,008 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ac338c38c/9c19a02a12b449fdb18546e83141238b/FLAGacd3ce31c [2025-01-09 04:50:23,024 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ac338c38c/9c19a02a12b449fdb18546e83141238b [2025-01-09 04:50:23,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:50:23,029 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:50:23,031 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:50:23,031 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:50:23,035 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:50:23,036 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:50:23" (1/1) ... [2025-01-09 04:50:23,037 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c5aca6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:23, skipping insertion in model container [2025-01-09 04:50:23,038 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:50:23" (1/1) ... [2025-01-09 04:50:23,069 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:50:23,239 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c[7981,7994] [2025-01-09 04:50:23,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:50:23,274 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:50:23,310 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c[7981,7994] [2025-01-09 04:50:23,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:50:23,349 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:50:23,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:23 WrapperNode [2025-01-09 04:50:23,350 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:50:23,350 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:50:23,351 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:50:23,351 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:50:23,355 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:50:23" (1/1) ... [2025-01-09 04:50:23,364 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:50:23" (1/1) ... [2025-01-09 04:50:23,385 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 688 [2025-01-09 04:50:23,385 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:50:23,386 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:50:23,386 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:50:23,386 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:50:23,392 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:23" (1/1) ... [2025-01-09 04:50:23,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:23" (1/1) ... [2025-01-09 04:50:23,395 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:23" (1/1) ... [2025-01-09 04:50:23,407 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:50:23,407 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:23" (1/1) ... [2025-01-09 04:50:23,407 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:23" (1/1) ... [2025-01-09 04:50:23,414 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:23" (1/1) ... [2025-01-09 04:50:23,415 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:23" (1/1) ... [2025-01-09 04:50:23,419 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:23" (1/1) ... [2025-01-09 04:50:23,421 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:23" (1/1) ... [2025-01-09 04:50:23,423 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:23" (1/1) ... [2025-01-09 04:50:23,425 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:50:23,426 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:50:23,426 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:50:23,426 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:50:23,427 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:23" (1/1) ... [2025-01-09 04:50:23,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:50:23,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:50:23,458 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:50:23,464 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:50:23,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:50:23,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:50:23,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:50:23,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:50:23,572 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:50:23,574 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:50:24,097 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2025-01-09 04:50:24,098 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:50:24,130 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:50:24,133 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:50:24,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:50:24 BoogieIcfgContainer [2025-01-09 04:50:24,134 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:50:24,135 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:50:24,136 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:50:24,140 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:50:24,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:50:23" (1/3) ... [2025-01-09 04:50:24,141 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b660088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:50:24, skipping insertion in model container [2025-01-09 04:50:24,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:23" (2/3) ... [2025-01-09 04:50:24,141 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b660088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:50:24, skipping insertion in model container [2025-01-09 04:50:24,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:50:24" (3/3) ... [2025-01-09 04:50:24,143 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2025-01-09 04:50:24,153 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:50:24,155 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c that has 1 procedures, 150 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 04:50:24,206 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:50:24,215 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;@39f501f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:50:24,215 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:50:24,218 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 148 states have (on average 1.7567567567567568) internal successors, (260), 149 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:24,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 04:50:24,222 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:24,226 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:50:24,227 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:24,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:24,235 INFO L85 PathProgramCache]: Analyzing trace with hash -95572409, now seen corresponding path program 1 times [2025-01-09 04:50:24,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:24,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062076728] [2025-01-09 04:50:24,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:24,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:24,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 04:50:24,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 04:50:24,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:24,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:24,837 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:50:24,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:24,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062076728] [2025-01-09 04:50:24,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062076728] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:24,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:24,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:50:24,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431947041] [2025-01-09 04:50:24,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:24,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:50:24,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:24,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:50:24,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:50:24,881 INFO L87 Difference]: Start difference. First operand has 150 states, 148 states have (on average 1.7567567567567568) internal successors, (260), 149 states have internal predecessors, (260), 0 states have call successors, (0), 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 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:25,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:25,319 INFO L93 Difference]: Finished difference Result 845 states and 1355 transitions. [2025-01-09 04:50:25,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 04:50:25,322 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-01-09 04:50:25,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:25,335 INFO L225 Difference]: With dead ends: 845 [2025-01-09 04:50:25,339 INFO L226 Difference]: Without dead ends: 751 [2025-01-09 04:50:25,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:50:25,346 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 1636 mSDsluCounter, 1455 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1636 SdHoareTripleChecker+Valid, 1886 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:25,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1636 Valid, 1886 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:50:25,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2025-01-09 04:50:25,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 227. [2025-01-09 04:50:25,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.4513274336283186) internal successors, (328), 226 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:25,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 328 transitions. [2025-01-09 04:50:25,405 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 328 transitions. Word has length 76 [2025-01-09 04:50:25,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:25,406 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 328 transitions. [2025-01-09 04:50:25,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:25,406 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 328 transitions. [2025-01-09 04:50:25,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 04:50:25,407 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:25,408 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:50:25,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:50:25,408 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:25,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:25,409 INFO L85 PathProgramCache]: Analyzing trace with hash -136563640, now seen corresponding path program 1 times [2025-01-09 04:50:25,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:25,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038308777] [2025-01-09 04:50:25,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:25,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:25,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 04:50:25,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 04:50:25,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:25,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:25,735 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:50:25,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:25,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038308777] [2025-01-09 04:50:25,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038308777] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:25,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:25,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:50:25,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227007427] [2025-01-09 04:50:25,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:25,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:50:25,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:25,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:50:25,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:50:25,741 INFO L87 Difference]: Start difference. First operand 227 states and 328 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:25,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:25,977 INFO L93 Difference]: Finished difference Result 922 states and 1419 transitions. [2025-01-09 04:50:25,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:50:25,978 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-01-09 04:50:25,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:25,981 INFO L225 Difference]: With dead ends: 922 [2025-01-09 04:50:25,981 INFO L226 Difference]: Without dead ends: 802 [2025-01-09 04:50:25,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:50:25,984 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 1023 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:25,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 1240 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:50:25,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2025-01-09 04:50:26,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 356. [2025-01-09 04:50:26,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 355 states have (on average 1.4985915492957746) internal successors, (532), 355 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:26,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 532 transitions. [2025-01-09 04:50:26,014 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 532 transitions. Word has length 78 [2025-01-09 04:50:26,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:26,014 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 532 transitions. [2025-01-09 04:50:26,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:26,014 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 532 transitions. [2025-01-09 04:50:26,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 04:50:26,015 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:26,015 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:50:26,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:50:26,016 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:26,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:26,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1646592496, now seen corresponding path program 1 times [2025-01-09 04:50:26,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:26,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876234804] [2025-01-09 04:50:26,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:26,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:26,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 04:50:26,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 04:50:26,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:26,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:26,319 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:50:26,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:26,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876234804] [2025-01-09 04:50:26,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876234804] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:26,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:26,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:50:26,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647029028] [2025-01-09 04:50:26,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:26,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:50:26,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:26,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:50:26,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:50:26,321 INFO L87 Difference]: Start difference. First operand 356 states and 532 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:26,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:26,675 INFO L93 Difference]: Finished difference Result 1046 states and 1615 transitions. [2025-01-09 04:50:26,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:50:26,679 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-01-09 04:50:26,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:26,684 INFO L225 Difference]: With dead ends: 1046 [2025-01-09 04:50:26,684 INFO L226 Difference]: Without dead ends: 926 [2025-01-09 04:50:26,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:50:26,685 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 1287 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1287 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:26,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1287 Valid, 1050 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:50:26,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2025-01-09 04:50:26,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 539. [2025-01-09 04:50:26,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 538 states have (on average 1.5260223048327137) internal successors, (821), 538 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:26,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 821 transitions. [2025-01-09 04:50:26,711 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 821 transitions. Word has length 78 [2025-01-09 04:50:26,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:26,711 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 821 transitions. [2025-01-09 04:50:26,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:26,712 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 821 transitions. [2025-01-09 04:50:26,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 04:50:26,714 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:26,714 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:50:26,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:50:26,714 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:26,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:26,715 INFO L85 PathProgramCache]: Analyzing trace with hash 641558373, now seen corresponding path program 1 times [2025-01-09 04:50:26,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:26,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556225259] [2025-01-09 04:50:26,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:26,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:26,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 04:50:26,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 04:50:26,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:26,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:27,102 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:50:27,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:27,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556225259] [2025-01-09 04:50:27,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556225259] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:27,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:27,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:50:27,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909350676] [2025-01-09 04:50:27,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:27,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:50:27,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:27,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:50:27,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:50:27,105 INFO L87 Difference]: Start difference. First operand 539 states and 821 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:27,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:27,284 INFO L93 Difference]: Finished difference Result 956 states and 1478 transitions. [2025-01-09 04:50:27,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:50:27,284 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-01-09 04:50:27,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:27,286 INFO L225 Difference]: With dead ends: 956 [2025-01-09 04:50:27,287 INFO L226 Difference]: Without dead ends: 541 [2025-01-09 04:50:27,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:50:27,288 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 484 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:27,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 678 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:50:27,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-01-09 04:50:27,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 539. [2025-01-09 04:50:27,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 538 states have (on average 1.5185873605947955) internal successors, (817), 538 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:27,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 817 transitions. [2025-01-09 04:50:27,298 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 817 transitions. Word has length 78 [2025-01-09 04:50:27,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:27,299 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 817 transitions. [2025-01-09 04:50:27,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:27,299 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 817 transitions. [2025-01-09 04:50:27,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 04:50:27,299 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:27,300 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:50:27,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:50:27,300 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:27,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:27,300 INFO L85 PathProgramCache]: Analyzing trace with hash 434659878, now seen corresponding path program 1 times [2025-01-09 04:50:27,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:27,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194665678] [2025-01-09 04:50:27,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:27,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:27,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 04:50:27,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 04:50:27,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:27,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:27,361 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:50:27,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:27,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194665678] [2025-01-09 04:50:27,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194665678] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:27,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:27,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:50:27,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924082853] [2025-01-09 04:50:27,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:27,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:50:27,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:27,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:50:27,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:50:27,363 INFO L87 Difference]: Start difference. First operand 539 states and 817 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:27,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:27,382 INFO L93 Difference]: Finished difference Result 1324 states and 2046 transitions. [2025-01-09 04:50:27,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:50:27,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-01-09 04:50:27,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:27,385 INFO L225 Difference]: With dead ends: 1324 [2025-01-09 04:50:27,385 INFO L226 Difference]: Without dead ends: 909 [2025-01-09 04:50:27,385 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:50:27,386 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 83 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:27,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 470 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:50:27,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2025-01-09 04:50:27,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 907. [2025-01-09 04:50:27,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 906 states have (on average 1.5220750551876379) internal successors, (1379), 906 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:27,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1379 transitions. [2025-01-09 04:50:27,400 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1379 transitions. Word has length 78 [2025-01-09 04:50:27,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:27,401 INFO L471 AbstractCegarLoop]: Abstraction has 907 states and 1379 transitions. [2025-01-09 04:50:27,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:27,401 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1379 transitions. [2025-01-09 04:50:27,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 04:50:27,401 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:27,402 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:50:27,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:50:27,402 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:27,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:27,402 INFO L85 PathProgramCache]: Analyzing trace with hash 450386228, now seen corresponding path program 1 times [2025-01-09 04:50:27,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:27,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733270737] [2025-01-09 04:50:27,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:27,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:27,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 04:50:27,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 04:50:27,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:27,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:27,525 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:50:27,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:27,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733270737] [2025-01-09 04:50:27,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733270737] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:27,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:27,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:50:27,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726030307] [2025-01-09 04:50:27,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:27,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:50:27,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:27,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:50:27,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:50:27,527 INFO L87 Difference]: Start difference. First operand 907 states and 1379 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:27,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:27,673 INFO L93 Difference]: Finished difference Result 2058 states and 3161 transitions. [2025-01-09 04:50:27,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:50:27,673 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-01-09 04:50:27,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:27,678 INFO L225 Difference]: With dead ends: 2058 [2025-01-09 04:50:27,678 INFO L226 Difference]: Without dead ends: 1833 [2025-01-09 04:50:27,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:50:27,680 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 1032 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1032 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:27,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1032 Valid, 1387 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:50:27,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1833 states. [2025-01-09 04:50:27,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1833 to 1131. [2025-01-09 04:50:27,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 1130 states have (on average 1.527433628318584) internal successors, (1726), 1130 states have internal predecessors, (1726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:27,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1726 transitions. [2025-01-09 04:50:27,704 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1726 transitions. Word has length 78 [2025-01-09 04:50:27,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:27,704 INFO L471 AbstractCegarLoop]: Abstraction has 1131 states and 1726 transitions. [2025-01-09 04:50:27,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:27,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1726 transitions. [2025-01-09 04:50:27,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 04:50:27,705 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:27,705 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:50:27,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:50:27,705 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:27,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:27,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1926158884, now seen corresponding path program 1 times [2025-01-09 04:50:27,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:27,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298884430] [2025-01-09 04:50:27,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:27,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:27,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 04:50:27,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 04:50:27,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:27,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:27,823 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:50:27,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:27,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298884430] [2025-01-09 04:50:27,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298884430] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:27,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:27,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:50:27,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981916645] [2025-01-09 04:50:27,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:27,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:50:27,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:27,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:50:27,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:50:27,824 INFO L87 Difference]: Start difference. First operand 1131 states and 1726 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:27,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:27,944 INFO L93 Difference]: Finished difference Result 2292 states and 3524 transitions. [2025-01-09 04:50:27,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:50:27,944 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-01-09 04:50:27,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:27,951 INFO L225 Difference]: With dead ends: 2292 [2025-01-09 04:50:27,951 INFO L226 Difference]: Without dead ends: 2067 [2025-01-09 04:50:27,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:50:27,953 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 1077 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:27,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 1595 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:50:27,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2025-01-09 04:50:27,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 1370. [2025-01-09 04:50:27,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1370 states, 1369 states have (on average 1.5317750182615046) internal successors, (2097), 1369 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:27,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 2097 transitions. [2025-01-09 04:50:27,994 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 2097 transitions. Word has length 78 [2025-01-09 04:50:27,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:27,995 INFO L471 AbstractCegarLoop]: Abstraction has 1370 states and 2097 transitions. [2025-01-09 04:50:27,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:27,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 2097 transitions. [2025-01-09 04:50:27,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 04:50:27,995 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:27,996 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:50:27,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:50:27,996 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:27,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:27,996 INFO L85 PathProgramCache]: Analyzing trace with hash 100434268, now seen corresponding path program 1 times [2025-01-09 04:50:27,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:27,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445684438] [2025-01-09 04:50:27,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:27,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:28,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 04:50:28,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 04:50:28,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:28,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:28,118 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:50:28,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:28,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445684438] [2025-01-09 04:50:28,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445684438] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:28,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:28,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:50:28,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541289030] [2025-01-09 04:50:28,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:28,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:50:28,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:28,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:50:28,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:50:28,120 INFO L87 Difference]: Start difference. First operand 1370 states and 2097 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:28,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:28,250 INFO L93 Difference]: Finished difference Result 2531 states and 3895 transitions. [2025-01-09 04:50:28,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:50:28,250 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-01-09 04:50:28,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:28,256 INFO L225 Difference]: With dead ends: 2531 [2025-01-09 04:50:28,256 INFO L226 Difference]: Without dead ends: 2306 [2025-01-09 04:50:28,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:50:28,257 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 1081 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:28,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1081 Valid, 1257 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:50:28,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2025-01-09 04:50:28,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 1609. [2025-01-09 04:50:28,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 1608 states have (on average 1.5348258706467661) internal successors, (2468), 1608 states have internal predecessors, (2468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:28,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2468 transitions. [2025-01-09 04:50:28,301 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2468 transitions. Word has length 78 [2025-01-09 04:50:28,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:28,301 INFO L471 AbstractCegarLoop]: Abstraction has 1609 states and 2468 transitions. [2025-01-09 04:50:28,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:28,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2468 transitions. [2025-01-09 04:50:28,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 04:50:28,302 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:28,302 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:50:28,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:50:28,302 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:28,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:28,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1588436194, now seen corresponding path program 1 times [2025-01-09 04:50:28,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:28,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483187154] [2025-01-09 04:50:28,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:28,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:28,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 04:50:28,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 04:50:28,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:28,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:28,386 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:50:28,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:28,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483187154] [2025-01-09 04:50:28,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483187154] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:28,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:28,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:50:28,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237564024] [2025-01-09 04:50:28,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:28,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:50:28,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:28,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:50:28,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:50:28,388 INFO L87 Difference]: Start difference. First operand 1609 states and 2468 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:28,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:28,561 INFO L93 Difference]: Finished difference Result 4698 states and 7251 transitions. [2025-01-09 04:50:28,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:50:28,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-01-09 04:50:28,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:28,571 INFO L225 Difference]: With dead ends: 4698 [2025-01-09 04:50:28,571 INFO L226 Difference]: Without dead ends: 3127 [2025-01-09 04:50:28,573 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:50:28,574 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 810 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:28,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 178 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:50:28,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3127 states. [2025-01-09 04:50:28,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3127 to 3125. [2025-01-09 04:50:28,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3125 states, 3124 states have (on average 1.5345710627400768) internal successors, (4794), 3124 states have internal predecessors, (4794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:28,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 4794 transitions. [2025-01-09 04:50:28,618 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 4794 transitions. Word has length 79 [2025-01-09 04:50:28,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:28,619 INFO L471 AbstractCegarLoop]: Abstraction has 3125 states and 4794 transitions. [2025-01-09 04:50:28,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:28,619 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 4794 transitions. [2025-01-09 04:50:28,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 04:50:28,619 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:28,619 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] [2025-01-09 04:50:28,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:50:28,620 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:28,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:28,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1613161725, now seen corresponding path program 1 times [2025-01-09 04:50:28,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:28,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987646321] [2025-01-09 04:50:28,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:28,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:28,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 04:50:28,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 04:50:28,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:28,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:28,722 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:50:28,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:28,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987646321] [2025-01-09 04:50:28,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987646321] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:28,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:28,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:50:28,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399083005] [2025-01-09 04:50:28,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:28,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:50:28,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:28,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:50:28,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:50:28,724 INFO L87 Difference]: Start difference. First operand 3125 states and 4794 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:28,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:28,897 INFO L93 Difference]: Finished difference Result 6196 states and 9530 transitions. [2025-01-09 04:50:28,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:50:28,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-01-09 04:50:28,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:28,906 INFO L225 Difference]: With dead ends: 6196 [2025-01-09 04:50:28,906 INFO L226 Difference]: Without dead ends: 3125 [2025-01-09 04:50:28,909 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:50:28,909 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 506 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:28,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 142 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:50:28,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3125 states. [2025-01-09 04:50:28,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3125 to 3125. [2025-01-09 04:50:28,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3125 states, 3124 states have (on average 1.517605633802817) internal successors, (4741), 3124 states have internal predecessors, (4741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:28,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 4741 transitions. [2025-01-09 04:50:28,954 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 4741 transitions. Word has length 80 [2025-01-09 04:50:28,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:28,954 INFO L471 AbstractCegarLoop]: Abstraction has 3125 states and 4741 transitions. [2025-01-09 04:50:28,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:28,954 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 4741 transitions. [2025-01-09 04:50:28,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 04:50:28,955 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:28,955 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:50:28,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:50:28,955 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:28,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:28,956 INFO L85 PathProgramCache]: Analyzing trace with hash -105949250, now seen corresponding path program 1 times [2025-01-09 04:50:28,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:28,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976240120] [2025-01-09 04:50:28,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:28,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:28,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 04:50:28,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 04:50:28,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:28,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:29,045 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:50:29,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:29,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976240120] [2025-01-09 04:50:29,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976240120] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:29,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:29,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:50:29,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122751139] [2025-01-09 04:50:29,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:29,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:50:29,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:29,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:50:29,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:50:29,047 INFO L87 Difference]: Start difference. First operand 3125 states and 4741 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:29,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:29,230 INFO L93 Difference]: Finished difference Result 6200 states and 9429 transitions. [2025-01-09 04:50:29,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:50:29,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-09 04:50:29,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:29,238 INFO L225 Difference]: With dead ends: 6200 [2025-01-09 04:50:29,238 INFO L226 Difference]: Without dead ends: 3125 [2025-01-09 04:50:29,242 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:50:29,242 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 511 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:29,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 134 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:50:29,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3125 states. [2025-01-09 04:50:29,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3125 to 3125. [2025-01-09 04:50:29,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3125 states, 3124 states have (on average 1.500640204865557) internal successors, (4688), 3124 states have internal predecessors, (4688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:29,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 4688 transitions. [2025-01-09 04:50:29,313 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 4688 transitions. Word has length 81 [2025-01-09 04:50:29,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:29,313 INFO L471 AbstractCegarLoop]: Abstraction has 3125 states and 4688 transitions. [2025-01-09 04:50:29,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:29,313 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 4688 transitions. [2025-01-09 04:50:29,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 04:50:29,314 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:29,314 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:50:29,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:50:29,314 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:29,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:29,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1094855209, now seen corresponding path program 1 times [2025-01-09 04:50:29,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:29,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097988436] [2025-01-09 04:50:29,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:29,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:29,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 04:50:29,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 04:50:29,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:29,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:29,394 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:50:29,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:29,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097988436] [2025-01-09 04:50:29,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097988436] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:29,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:29,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:50:29,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591335043] [2025-01-09 04:50:29,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:29,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:50:29,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:29,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:50:29,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:50:29,396 INFO L87 Difference]: Start difference. First operand 3125 states and 4688 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:29,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:29,630 INFO L93 Difference]: Finished difference Result 6208 states and 9333 transitions. [2025-01-09 04:50:29,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:50:29,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-01-09 04:50:29,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:29,640 INFO L225 Difference]: With dead ends: 6208 [2025-01-09 04:50:29,640 INFO L226 Difference]: Without dead ends: 3125 [2025-01-09 04:50:29,644 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:50:29,644 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 527 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:29,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 118 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:50:29,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3125 states. [2025-01-09 04:50:29,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3125 to 3125. [2025-01-09 04:50:29,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3125 states, 3124 states have (on average 1.483674775928297) internal successors, (4635), 3124 states have internal predecessors, (4635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:29,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 4635 transitions. [2025-01-09 04:50:29,698 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 4635 transitions. Word has length 82 [2025-01-09 04:50:29,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:29,698 INFO L471 AbstractCegarLoop]: Abstraction has 3125 states and 4635 transitions. [2025-01-09 04:50:29,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:29,699 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 4635 transitions. [2025-01-09 04:50:29,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 04:50:29,699 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:29,699 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] [2025-01-09 04:50:29,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:50:29,700 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:29,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:29,700 INFO L85 PathProgramCache]: Analyzing trace with hash -674687266, now seen corresponding path program 1 times [2025-01-09 04:50:29,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:29,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706381377] [2025-01-09 04:50:29,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:29,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:29,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 04:50:29,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 04:50:29,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:29,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:29,799 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:50:29,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:29,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706381377] [2025-01-09 04:50:29,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706381377] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:29,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:29,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:50:29,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614686430] [2025-01-09 04:50:29,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:29,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:50:29,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:29,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:50:29,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:50:29,801 INFO L87 Difference]: Start difference. First operand 3125 states and 4635 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:29,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:29,970 INFO L93 Difference]: Finished difference Result 6204 states and 9223 transitions. [2025-01-09 04:50:29,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:50:29,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-01-09 04:50:29,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:29,978 INFO L225 Difference]: With dead ends: 6204 [2025-01-09 04:50:29,978 INFO L226 Difference]: Without dead ends: 3125 [2025-01-09 04:50:29,981 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:50:29,982 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 509 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:29,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 126 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:50:29,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3125 states. [2025-01-09 04:50:30,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3125 to 3125. [2025-01-09 04:50:30,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3125 states, 3124 states have (on average 1.466709346991037) internal successors, (4582), 3124 states have internal predecessors, (4582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:30,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 4582 transitions. [2025-01-09 04:50:30,026 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 4582 transitions. Word has length 83 [2025-01-09 04:50:30,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:30,026 INFO L471 AbstractCegarLoop]: Abstraction has 3125 states and 4582 transitions. [2025-01-09 04:50:30,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:30,026 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 4582 transitions. [2025-01-09 04:50:30,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 04:50:30,027 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:30,027 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] [2025-01-09 04:50:30,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:50:30,027 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:30,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:30,028 INFO L85 PathProgramCache]: Analyzing trace with hash 340263851, now seen corresponding path program 1 times [2025-01-09 04:50:30,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:30,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690294508] [2025-01-09 04:50:30,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:30,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:30,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 04:50:30,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 04:50:30,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:30,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:30,264 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:50:30,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:30,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690294508] [2025-01-09 04:50:30,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690294508] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:30,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:30,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:50:30,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957008942] [2025-01-09 04:50:30,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:30,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:50:30,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:30,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:50:30,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:50:30,266 INFO L87 Difference]: Start difference. First operand 3125 states and 4582 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:30,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:30,308 INFO L93 Difference]: Finished difference Result 3151 states and 4619 transitions. [2025-01-09 04:50:30,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:50:30,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2025-01-09 04:50:30,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:30,314 INFO L225 Difference]: With dead ends: 3151 [2025-01-09 04:50:30,315 INFO L226 Difference]: Without dead ends: 3149 [2025-01-09 04:50:30,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:50:30,316 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 0 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:30,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 745 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:50:30,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3149 states. [2025-01-09 04:50:30,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3149 to 3149. [2025-01-09 04:50:30,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3149 states, 3148 states have (on average 1.4587039390088945) internal successors, (4592), 3148 states have internal predecessors, (4592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:30,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3149 states to 3149 states and 4592 transitions. [2025-01-09 04:50:30,367 INFO L78 Accepts]: Start accepts. Automaton has 3149 states and 4592 transitions. Word has length 84 [2025-01-09 04:50:30,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:30,367 INFO L471 AbstractCegarLoop]: Abstraction has 3149 states and 4592 transitions. [2025-01-09 04:50:30,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:30,368 INFO L276 IsEmpty]: Start isEmpty. Operand 3149 states and 4592 transitions. [2025-01-09 04:50:30,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 04:50:30,369 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:30,369 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] [2025-01-09 04:50:30,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:50:30,369 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:30,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:30,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1580243929, now seen corresponding path program 1 times [2025-01-09 04:50:30,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:30,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227613388] [2025-01-09 04:50:30,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:30,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:30,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 04:50:30,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 04:50:30,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:30,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:30,811 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:50:30,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:30,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227613388] [2025-01-09 04:50:30,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227613388] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:30,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:30,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 04:50:30,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987548220] [2025-01-09 04:50:30,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:30,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:50:30,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:30,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:50:30,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:50:30,813 INFO L87 Difference]: Start difference. First operand 3149 states and 4592 transitions. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:31,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:31,318 INFO L93 Difference]: Finished difference Result 9292 states and 13540 transitions. [2025-01-09 04:50:31,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:50:31,318 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2025-01-09 04:50:31,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:31,329 INFO L225 Difference]: With dead ends: 9292 [2025-01-09 04:50:31,329 INFO L226 Difference]: Without dead ends: 6280 [2025-01-09 04:50:31,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:50:31,334 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 876 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:31,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 568 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:50:31,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6280 states. [2025-01-09 04:50:31,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6280 to 3149. [2025-01-09 04:50:31,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3149 states, 3148 states have (on average 1.4567979669631512) internal successors, (4586), 3148 states have internal predecessors, (4586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:31,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3149 states to 3149 states and 4586 transitions. [2025-01-09 04:50:31,389 INFO L78 Accepts]: Start accepts. Automaton has 3149 states and 4586 transitions. Word has length 84 [2025-01-09 04:50:31,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:31,389 INFO L471 AbstractCegarLoop]: Abstraction has 3149 states and 4586 transitions. [2025-01-09 04:50:31,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:31,390 INFO L276 IsEmpty]: Start isEmpty. Operand 3149 states and 4586 transitions. [2025-01-09 04:50:31,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 04:50:31,391 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:31,391 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] [2025-01-09 04:50:31,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:50:31,391 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:31,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:31,392 INFO L85 PathProgramCache]: Analyzing trace with hash 568884420, now seen corresponding path program 1 times [2025-01-09 04:50:31,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:31,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891349547] [2025-01-09 04:50:31,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:31,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:31,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 04:50:31,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 04:50:31,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:31,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:31,736 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:50:31,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:31,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891349547] [2025-01-09 04:50:31,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891349547] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:31,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:31,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 04:50:31,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418288479] [2025-01-09 04:50:31,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:31,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:50:31,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:31,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:50:31,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:50:31,737 INFO L87 Difference]: Start difference. First operand 3149 states and 4586 transitions. Second operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:32,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:32,236 INFO L93 Difference]: Finished difference Result 9172 states and 13342 transitions. [2025-01-09 04:50:32,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:50:32,236 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-01-09 04:50:32,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:32,245 INFO L225 Difference]: With dead ends: 9172 [2025-01-09 04:50:32,246 INFO L226 Difference]: Without dead ends: 6235 [2025-01-09 04:50:32,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:50:32,250 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 1074 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1074 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:32,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1074 Valid, 633 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:50:32,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6235 states. [2025-01-09 04:50:32,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6235 to 3149. [2025-01-09 04:50:32,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3149 states, 3148 states have (on average 1.4533036848792884) internal successors, (4575), 3148 states have internal predecessors, (4575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:32,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3149 states to 3149 states and 4575 transitions. [2025-01-09 04:50:32,320 INFO L78 Accepts]: Start accepts. Automaton has 3149 states and 4575 transitions. Word has length 85 [2025-01-09 04:50:32,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:32,321 INFO L471 AbstractCegarLoop]: Abstraction has 3149 states and 4575 transitions. [2025-01-09 04:50:32,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:32,321 INFO L276 IsEmpty]: Start isEmpty. Operand 3149 states and 4575 transitions. [2025-01-09 04:50:32,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 04:50:32,322 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:32,322 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] [2025-01-09 04:50:32,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:50:32,323 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:32,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:32,324 INFO L85 PathProgramCache]: Analyzing trace with hash -627321848, now seen corresponding path program 1 times [2025-01-09 04:50:32,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:32,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665372341] [2025-01-09 04:50:32,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:32,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:32,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 04:50:32,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 04:50:32,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:32,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:32,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:32,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:32,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665372341] [2025-01-09 04:50:32,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665372341] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:32,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:32,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:50:32,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770744726] [2025-01-09 04:50:32,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:32,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:50:32,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:32,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:50:32,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:50:32,646 INFO L87 Difference]: Start difference. First operand 3149 states and 4575 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:33,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:33,001 INFO L93 Difference]: Finished difference Result 9078 states and 13239 transitions. [2025-01-09 04:50:33,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:50:33,002 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-01-09 04:50:33,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:33,011 INFO L225 Difference]: With dead ends: 9078 [2025-01-09 04:50:33,011 INFO L226 Difference]: Without dead ends: 6086 [2025-01-09 04:50:33,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-01-09 04:50:33,016 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 776 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:33,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 601 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:50:33,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6086 states. [2025-01-09 04:50:33,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6086 to 3149. [2025-01-09 04:50:33,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3149 states, 3148 states have (on average 1.4529860228716645) internal successors, (4574), 3148 states have internal predecessors, (4574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:33,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3149 states to 3149 states and 4574 transitions. [2025-01-09 04:50:33,082 INFO L78 Accepts]: Start accepts. Automaton has 3149 states and 4574 transitions. Word has length 85 [2025-01-09 04:50:33,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:33,083 INFO L471 AbstractCegarLoop]: Abstraction has 3149 states and 4574 transitions. [2025-01-09 04:50:33,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:33,083 INFO L276 IsEmpty]: Start isEmpty. Operand 3149 states and 4574 transitions. [2025-01-09 04:50:33,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 04:50:33,084 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:33,084 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] [2025-01-09 04:50:33,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:50:33,084 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:33,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:33,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1476124269, now seen corresponding path program 1 times [2025-01-09 04:50:33,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:33,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016669599] [2025-01-09 04:50:33,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:33,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:33,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 04:50:33,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 04:50:33,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:33,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:33,538 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:50:33,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:33,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016669599] [2025-01-09 04:50:33,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016669599] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:33,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:33,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 04:50:33,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919816057] [2025-01-09 04:50:33,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:33,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 04:50:33,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:33,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 04:50:33,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:50:33,543 INFO L87 Difference]: Start difference. First operand 3149 states and 4574 transitions. Second operand has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 13 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:34,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:34,154 INFO L93 Difference]: Finished difference Result 9428 states and 13622 transitions. [2025-01-09 04:50:34,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 04:50:34,155 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 13 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-01-09 04:50:34,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:34,163 INFO L225 Difference]: With dead ends: 9428 [2025-01-09 04:50:34,163 INFO L226 Difference]: Without dead ends: 6463 [2025-01-09 04:50:34,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2025-01-09 04:50:34,167 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 697 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:34,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 690 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:50:34,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6463 states. [2025-01-09 04:50:34,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6463 to 3182. [2025-01-09 04:50:34,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3182 states, 3181 states have (on average 1.4501729016032694) internal successors, (4613), 3181 states have internal predecessors, (4613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:34,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3182 states to 3182 states and 4613 transitions. [2025-01-09 04:50:34,208 INFO L78 Accepts]: Start accepts. Automaton has 3182 states and 4613 transitions. Word has length 86 [2025-01-09 04:50:34,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:34,208 INFO L471 AbstractCegarLoop]: Abstraction has 3182 states and 4613 transitions. [2025-01-09 04:50:34,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 13 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:34,208 INFO L276 IsEmpty]: Start isEmpty. Operand 3182 states and 4613 transitions. [2025-01-09 04:50:34,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 04:50:34,209 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:34,210 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] [2025-01-09 04:50:34,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:50:34,210 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:34,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:34,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1856676913, now seen corresponding path program 1 times [2025-01-09 04:50:34,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:34,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448279377] [2025-01-09 04:50:34,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:34,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:34,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 04:50:34,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 04:50:34,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:34,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:34,598 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:50:34,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:34,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448279377] [2025-01-09 04:50:34,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448279377] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:34,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:34,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 04:50:34,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766824986] [2025-01-09 04:50:34,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:34,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:50:34,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:34,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:50:34,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:50:34,601 INFO L87 Difference]: Start difference. First operand 3182 states and 4613 transitions. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 11 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:35,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:35,417 INFO L93 Difference]: Finished difference Result 7865 states and 11399 transitions. [2025-01-09 04:50:35,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 04:50:35,417 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 11 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-01-09 04:50:35,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:35,424 INFO L225 Difference]: With dead ends: 7865 [2025-01-09 04:50:35,424 INFO L226 Difference]: Without dead ends: 4838 [2025-01-09 04:50:35,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=522, Unknown=0, NotChecked=0, Total=702 [2025-01-09 04:50:35,428 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 895 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 1286 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 1296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:35,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [895 Valid, 1404 Invalid, 1296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1286 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:50:35,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4838 states. [2025-01-09 04:50:35,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4838 to 3149. [2025-01-09 04:50:35,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3149 states, 3148 states have (on average 1.4520330368487928) internal successors, (4571), 3148 states have internal predecessors, (4571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:35,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3149 states to 3149 states and 4571 transitions. [2025-01-09 04:50:35,464 INFO L78 Accepts]: Start accepts. Automaton has 3149 states and 4571 transitions. Word has length 87 [2025-01-09 04:50:35,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:35,464 INFO L471 AbstractCegarLoop]: Abstraction has 3149 states and 4571 transitions. [2025-01-09 04:50:35,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 11 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:35,465 INFO L276 IsEmpty]: Start isEmpty. Operand 3149 states and 4571 transitions. [2025-01-09 04:50:35,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 04:50:35,465 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:35,466 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] [2025-01-09 04:50:35,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:50:35,467 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:35,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:35,467 INFO L85 PathProgramCache]: Analyzing trace with hash 135072209, now seen corresponding path program 1 times [2025-01-09 04:50:35,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:35,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046426207] [2025-01-09 04:50:35,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:35,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:35,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 04:50:35,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 04:50:35,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:35,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:35,770 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:50:35,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:35,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046426207] [2025-01-09 04:50:35,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046426207] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:35,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:35,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:50:35,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315642414] [2025-01-09 04:50:35,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:35,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:50:35,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:35,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:50:35,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:50:35,773 INFO L87 Difference]: Start difference. First operand 3149 states and 4571 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:36,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:36,160 INFO L93 Difference]: Finished difference Result 9247 states and 13429 transitions. [2025-01-09 04:50:36,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:50:36,160 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-01-09 04:50:36,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:36,169 INFO L225 Difference]: With dead ends: 9247 [2025-01-09 04:50:36,169 INFO L226 Difference]: Without dead ends: 6265 [2025-01-09 04:50:36,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-01-09 04:50:36,175 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 1008 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1008 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:36,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1008 Valid, 564 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:50:36,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6265 states. [2025-01-09 04:50:36,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6265 to 3149. [2025-01-09 04:50:36,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3149 states, 3148 states have (on average 1.449174078780178) internal successors, (4562), 3148 states have internal predecessors, (4562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:36,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3149 states to 3149 states and 4562 transitions. [2025-01-09 04:50:36,209 INFO L78 Accepts]: Start accepts. Automaton has 3149 states and 4562 transitions. Word has length 87 [2025-01-09 04:50:36,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:36,210 INFO L471 AbstractCegarLoop]: Abstraction has 3149 states and 4562 transitions. [2025-01-09 04:50:36,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:36,210 INFO L276 IsEmpty]: Start isEmpty. Operand 3149 states and 4562 transitions. [2025-01-09 04:50:36,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 04:50:36,210 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:36,211 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] [2025-01-09 04:50:36,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:50:36,211 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:36,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:36,211 INFO L85 PathProgramCache]: Analyzing trace with hash -479617813, now seen corresponding path program 1 times [2025-01-09 04:50:36,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:36,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251546029] [2025-01-09 04:50:36,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:36,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:36,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 04:50:36,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 04:50:36,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:36,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:36,755 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:50:36,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:36,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251546029] [2025-01-09 04:50:36,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251546029] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:36,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:36,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 04:50:36,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249087799] [2025-01-09 04:50:36,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:36,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:50:36,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:36,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:50:36,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:50:36,758 INFO L87 Difference]: Start difference. First operand 3149 states and 4562 transitions. Second operand has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:37,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:37,306 INFO L93 Difference]: Finished difference Result 7063 states and 10278 transitions. [2025-01-09 04:50:37,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:50:37,307 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-01-09 04:50:37,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:37,318 INFO L225 Difference]: With dead ends: 7063 [2025-01-09 04:50:37,319 INFO L226 Difference]: Without dead ends: 6117 [2025-01-09 04:50:37,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:50:37,322 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 690 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:37,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 1544 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:50:37,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6117 states. [2025-01-09 04:50:37,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6117 to 3122. [2025-01-09 04:50:37,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3122 states, 3121 states have (on average 1.4479333546940083) internal successors, (4519), 3121 states have internal predecessors, (4519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:37,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 4519 transitions. [2025-01-09 04:50:37,371 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 4519 transitions. Word has length 88 [2025-01-09 04:50:37,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:37,371 INFO L471 AbstractCegarLoop]: Abstraction has 3122 states and 4519 transitions. [2025-01-09 04:50:37,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:37,372 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 4519 transitions. [2025-01-09 04:50:37,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 04:50:37,373 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:37,373 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] [2025-01-09 04:50:37,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:50:37,373 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:37,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:37,374 INFO L85 PathProgramCache]: Analyzing trace with hash -949937908, now seen corresponding path program 1 times [2025-01-09 04:50:37,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:37,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751756337] [2025-01-09 04:50:37,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:37,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:37,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 04:50:37,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 04:50:37,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:37,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:38,065 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:50:38,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:38,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751756337] [2025-01-09 04:50:38,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751756337] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:38,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:38,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 04:50:38,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342101827] [2025-01-09 04:50:38,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:38,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 04:50:38,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:38,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 04:50:38,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:50:38,067 INFO L87 Difference]: Start difference. First operand 3122 states and 4519 transitions. Second operand has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:38,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:38,916 INFO L93 Difference]: Finished difference Result 12956 states and 18881 transitions. [2025-01-09 04:50:38,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 04:50:38,916 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-01-09 04:50:38,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:38,935 INFO L225 Difference]: With dead ends: 12956 [2025-01-09 04:50:38,936 INFO L226 Difference]: Without dead ends: 12030 [2025-01-09 04:50:38,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-01-09 04:50:38,943 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 666 mSDsluCounter, 3360 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 3790 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:38,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 3790 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:50:38,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12030 states. [2025-01-09 04:50:39,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12030 to 3105. [2025-01-09 04:50:39,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3105 states, 3104 states have (on average 1.446520618556701) internal successors, (4490), 3104 states have internal predecessors, (4490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:39,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3105 states to 3105 states and 4490 transitions. [2025-01-09 04:50:39,037 INFO L78 Accepts]: Start accepts. Automaton has 3105 states and 4490 transitions. Word has length 88 [2025-01-09 04:50:39,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:39,037 INFO L471 AbstractCegarLoop]: Abstraction has 3105 states and 4490 transitions. [2025-01-09 04:50:39,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:39,037 INFO L276 IsEmpty]: Start isEmpty. Operand 3105 states and 4490 transitions. [2025-01-09 04:50:39,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 04:50:39,037 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:39,038 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] [2025-01-09 04:50:39,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 04:50:39,038 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:39,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:39,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1448445622, now seen corresponding path program 1 times [2025-01-09 04:50:39,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:39,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237953948] [2025-01-09 04:50:39,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:39,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:39,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 04:50:39,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 04:50:39,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:39,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:39,479 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:50:39,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:39,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237953948] [2025-01-09 04:50:39,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237953948] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:39,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:39,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 04:50:39,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510337659] [2025-01-09 04:50:39,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:39,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 04:50:39,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:39,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 04:50:39,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:50:39,481 INFO L87 Difference]: Start difference. First operand 3105 states and 4490 transitions. Second operand has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:40,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:40,134 INFO L93 Difference]: Finished difference Result 7889 states and 11468 transitions. [2025-01-09 04:50:40,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 04:50:40,134 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-01-09 04:50:40,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:40,144 INFO L225 Difference]: With dead ends: 7889 [2025-01-09 04:50:40,144 INFO L226 Difference]: Without dead ends: 6938 [2025-01-09 04:50:40,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-01-09 04:50:40,146 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 981 mSDsluCounter, 2440 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 981 SdHoareTripleChecker+Valid, 2750 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:40,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [981 Valid, 2750 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:50:40,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6938 states. [2025-01-09 04:50:40,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6938 to 3057. [2025-01-09 04:50:40,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3057 states, 3056 states have (on average 1.4486256544502618) internal successors, (4427), 3056 states have internal predecessors, (4427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:40,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3057 states to 3057 states and 4427 transitions. [2025-01-09 04:50:40,181 INFO L78 Accepts]: Start accepts. Automaton has 3057 states and 4427 transitions. Word has length 88 [2025-01-09 04:50:40,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:40,181 INFO L471 AbstractCegarLoop]: Abstraction has 3057 states and 4427 transitions. [2025-01-09 04:50:40,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:40,181 INFO L276 IsEmpty]: Start isEmpty. Operand 3057 states and 4427 transitions. [2025-01-09 04:50:40,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 04:50:40,182 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:40,182 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] [2025-01-09 04:50:40,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 04:50:40,183 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:40,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:40,183 INFO L85 PathProgramCache]: Analyzing trace with hash 2022927913, now seen corresponding path program 1 times [2025-01-09 04:50:40,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:40,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647685785] [2025-01-09 04:50:40,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:40,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:40,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 04:50:40,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 04:50:40,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:40,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:41,337 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:50:41,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:41,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647685785] [2025-01-09 04:50:41,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647685785] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:41,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:41,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-01-09 04:50:41,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286805725] [2025-01-09 04:50:41,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:41,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 04:50:41,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:41,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 04:50:41,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2025-01-09 04:50:41,339 INFO L87 Difference]: Start difference. First operand 3057 states and 4427 transitions. Second operand has 22 states, 22 states have (on average 4.0) internal successors, (88), 22 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:43,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:43,324 INFO L93 Difference]: Finished difference Result 7821 states and 11380 transitions. [2025-01-09 04:50:43,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 04:50:43,328 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.0) internal successors, (88), 22 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-01-09 04:50:43,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:43,335 INFO L225 Difference]: With dead ends: 7821 [2025-01-09 04:50:43,335 INFO L226 Difference]: Without dead ends: 6907 [2025-01-09 04:50:43,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=324, Invalid=1236, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 04:50:43,338 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 1304 mSDsluCounter, 3898 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1304 SdHoareTripleChecker+Valid, 4314 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:43,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1304 Valid, 4314 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1652 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 04:50:43,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6907 states. [2025-01-09 04:50:43,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6907 to 3061. [2025-01-09 04:50:43,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3061 states, 3060 states have (on average 1.4480392156862745) internal successors, (4431), 3060 states have internal predecessors, (4431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:43,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3061 states to 3061 states and 4431 transitions. [2025-01-09 04:50:43,375 INFO L78 Accepts]: Start accepts. Automaton has 3061 states and 4431 transitions. Word has length 88 [2025-01-09 04:50:43,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:43,375 INFO L471 AbstractCegarLoop]: Abstraction has 3061 states and 4431 transitions. [2025-01-09 04:50:43,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.0) internal successors, (88), 22 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:43,375 INFO L276 IsEmpty]: Start isEmpty. Operand 3061 states and 4431 transitions. [2025-01-09 04:50:43,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 04:50:43,376 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:43,376 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] [2025-01-09 04:50:43,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 04:50:43,376 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:43,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:43,377 INFO L85 PathProgramCache]: Analyzing trace with hash 392224756, now seen corresponding path program 1 times [2025-01-09 04:50:43,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:43,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906366410] [2025-01-09 04:50:43,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:43,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:43,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:50:43,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:50:43,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:43,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:43,475 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:50:43,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:43,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906366410] [2025-01-09 04:50:43,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906366410] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:43,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:43,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:50:43,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338212148] [2025-01-09 04:50:43,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:43,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:50:43,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:43,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:50:43,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:50:43,478 INFO L87 Difference]: Start difference. First operand 3061 states and 4431 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:43,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:43,519 INFO L93 Difference]: Finished difference Result 7274 states and 10596 transitions. [2025-01-09 04:50:43,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:50:43,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-01-09 04:50:43,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:43,525 INFO L225 Difference]: With dead ends: 7274 [2025-01-09 04:50:43,525 INFO L226 Difference]: Without dead ends: 4348 [2025-01-09 04:50:43,528 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:50:43,528 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 90 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:43,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 506 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:50:43,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4348 states. [2025-01-09 04:50:43,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4348 to 4346. [2025-01-09 04:50:43,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4346 states, 4345 states have (on average 1.445109321058688) internal successors, (6279), 4345 states have internal predecessors, (6279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:43,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4346 states to 4346 states and 6279 transitions. [2025-01-09 04:50:43,570 INFO L78 Accepts]: Start accepts. Automaton has 4346 states and 6279 transitions. Word has length 89 [2025-01-09 04:50:43,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:43,570 INFO L471 AbstractCegarLoop]: Abstraction has 4346 states and 6279 transitions. [2025-01-09 04:50:43,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:43,570 INFO L276 IsEmpty]: Start isEmpty. Operand 4346 states and 6279 transitions. [2025-01-09 04:50:43,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 04:50:43,571 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:43,572 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] [2025-01-09 04:50:43,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 04:50:43,572 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:43,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:43,572 INFO L85 PathProgramCache]: Analyzing trace with hash 457321015, now seen corresponding path program 1 times [2025-01-09 04:50:43,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:43,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561640558] [2025-01-09 04:50:43,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:43,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:43,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:50:43,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:50:43,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:43,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:45,098 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:50:45,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:45,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561640558] [2025-01-09 04:50:45,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561640558] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:45,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:45,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2025-01-09 04:50:45,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772489863] [2025-01-09 04:50:45,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:45,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-09 04:50:45,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:45,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-09 04:50:45,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 04:50:45,101 INFO L87 Difference]: Start difference. First operand 4346 states and 6279 transitions. Second operand has 33 states, 33 states have (on average 2.696969696969697) internal successors, (89), 33 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:49,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:49,026 INFO L93 Difference]: Finished difference Result 12281 states and 17800 transitions. [2025-01-09 04:50:49,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-01-09 04:50:49,027 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.696969696969697) internal successors, (89), 33 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-01-09 04:50:49,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:49,052 INFO L225 Difference]: With dead ends: 12281 [2025-01-09 04:50:49,055 INFO L226 Difference]: Without dead ends: 11164 [2025-01-09 04:50:49,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=554, Invalid=3106, Unknown=0, NotChecked=0, Total=3660 [2025-01-09 04:50:49,065 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 1272 mSDsluCounter, 7643 mSDsCounter, 0 mSdLazyCounter, 5312 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1272 SdHoareTripleChecker+Valid, 8109 SdHoareTripleChecker+Invalid, 5324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 5312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:49,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1272 Valid, 8109 Invalid, 5324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 5312 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-09 04:50:49,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11164 states. [2025-01-09 04:50:49,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11164 to 4359. [2025-01-09 04:50:49,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4359 states, 4358 states have (on average 1.4444699403396053) internal successors, (6295), 4358 states have internal predecessors, (6295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:49,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4359 states to 4359 states and 6295 transitions. [2025-01-09 04:50:49,224 INFO L78 Accepts]: Start accepts. Automaton has 4359 states and 6295 transitions. Word has length 89 [2025-01-09 04:50:49,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:49,225 INFO L471 AbstractCegarLoop]: Abstraction has 4359 states and 6295 transitions. [2025-01-09 04:50:49,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.696969696969697) internal successors, (89), 33 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:49,225 INFO L276 IsEmpty]: Start isEmpty. Operand 4359 states and 6295 transitions. [2025-01-09 04:50:49,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 04:50:49,225 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:49,226 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] [2025-01-09 04:50:49,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 04:50:49,227 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:49,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:49,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1278278169, now seen corresponding path program 1 times [2025-01-09 04:50:49,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:49,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298319093] [2025-01-09 04:50:49,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:49,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:49,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:50:49,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:50:49,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:49,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:50,082 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:50:50,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:50,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298319093] [2025-01-09 04:50:50,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298319093] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:50,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:50,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 04:50:50,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899448066] [2025-01-09 04:50:50,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:50,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 04:50:50,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:50,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 04:50:50,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:50:50,087 INFO L87 Difference]: Start difference. First operand 4359 states and 6295 transitions. Second operand has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:50,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:50,779 INFO L93 Difference]: Finished difference Result 18346 states and 26645 transitions. [2025-01-09 04:50:50,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 04:50:50,780 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-01-09 04:50:50,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:50,794 INFO L225 Difference]: With dead ends: 18346 [2025-01-09 04:50:50,794 INFO L226 Difference]: Without dead ends: 17013 [2025-01-09 04:50:50,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-01-09 04:50:50,800 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 925 mSDsluCounter, 3082 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 3489 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:50,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 3489 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:50:50,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17013 states. [2025-01-09 04:50:50,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17013 to 4343. [2025-01-09 04:50:51,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4343 states, 4342 states have (on average 1.444725932749885) internal successors, (6273), 4342 states have internal predecessors, (6273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:51,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4343 states to 4343 states and 6273 transitions. [2025-01-09 04:50:51,012 INFO L78 Accepts]: Start accepts. Automaton has 4343 states and 6273 transitions. Word has length 89 [2025-01-09 04:50:51,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:51,013 INFO L471 AbstractCegarLoop]: Abstraction has 4343 states and 6273 transitions. [2025-01-09 04:50:51,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:51,013 INFO L276 IsEmpty]: Start isEmpty. Operand 4343 states and 6273 transitions. [2025-01-09 04:50:51,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 04:50:51,013 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:51,013 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:50:51,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 04:50:51,014 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:51,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:51,014 INFO L85 PathProgramCache]: Analyzing trace with hash -833885365, now seen corresponding path program 1 times [2025-01-09 04:50:51,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:51,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872977085] [2025-01-09 04:50:51,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:51,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:51,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 04:50:51,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 04:50:51,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:51,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:51,449 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:50:51,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:51,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872977085] [2025-01-09 04:50:51,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872977085] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:51,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:51,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 04:50:51,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712017265] [2025-01-09 04:50:51,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:51,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:50:51,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:51,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:50:51,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:50:51,451 INFO L87 Difference]: Start difference. First operand 4343 states and 6273 transitions. Second operand has 12 states, 12 states have (on average 7.5) internal successors, (90), 12 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:51,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:51,874 INFO L93 Difference]: Finished difference Result 9458 states and 13724 transitions. [2025-01-09 04:50:51,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:50:51,875 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.5) internal successors, (90), 12 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2025-01-09 04:50:51,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:51,882 INFO L225 Difference]: With dead ends: 9458 [2025-01-09 04:50:51,882 INFO L226 Difference]: Without dead ends: 8317 [2025-01-09 04:50:51,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2025-01-09 04:50:51,886 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 540 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:51,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 1288 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:50:51,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8317 states. [2025-01-09 04:50:51,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8317 to 4211. [2025-01-09 04:50:51,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4211 states, 4210 states have (on average 1.4465558194774346) internal successors, (6090), 4210 states have internal predecessors, (6090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:51,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4211 states to 4211 states and 6090 transitions. [2025-01-09 04:50:51,959 INFO L78 Accepts]: Start accepts. Automaton has 4211 states and 6090 transitions. Word has length 90 [2025-01-09 04:50:51,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:51,960 INFO L471 AbstractCegarLoop]: Abstraction has 4211 states and 6090 transitions. [2025-01-09 04:50:51,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.5) internal successors, (90), 12 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:51,960 INFO L276 IsEmpty]: Start isEmpty. Operand 4211 states and 6090 transitions. [2025-01-09 04:50:51,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 04:50:51,962 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:51,962 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:50:51,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 04:50:51,962 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:51,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:51,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1913678620, now seen corresponding path program 1 times [2025-01-09 04:50:51,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:51,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46634400] [2025-01-09 04:50:51,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:51,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:51,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 04:50:51,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 04:50:51,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:51,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:52,024 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:52,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:52,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46634400] [2025-01-09 04:50:52,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46634400] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:52,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:52,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:50:52,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852292489] [2025-01-09 04:50:52,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:52,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:50:52,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:52,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:50:52,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:50:52,026 INFO L87 Difference]: Start difference. First operand 4211 states and 6090 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:52,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:52,049 INFO L93 Difference]: Finished difference Result 8841 states and 12831 transitions. [2025-01-09 04:50:52,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:50:52,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2025-01-09 04:50:52,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:52,054 INFO L225 Difference]: With dead ends: 8841 [2025-01-09 04:50:52,054 INFO L226 Difference]: Without dead ends: 5915 [2025-01-09 04:50:52,057 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:50:52,057 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 83 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:52,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 395 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:50:52,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5915 states. [2025-01-09 04:50:52,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5915 to 5697. [2025-01-09 04:50:52,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5697 states, 5696 states have (on average 1.4396067415730338) internal successors, (8200), 5696 states have internal predecessors, (8200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:52,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5697 states to 5697 states and 8200 transitions. [2025-01-09 04:50:52,100 INFO L78 Accepts]: Start accepts. Automaton has 5697 states and 8200 transitions. Word has length 117 [2025-01-09 04:50:52,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:52,101 INFO L471 AbstractCegarLoop]: Abstraction has 5697 states and 8200 transitions. [2025-01-09 04:50:52,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:52,102 INFO L276 IsEmpty]: Start isEmpty. Operand 5697 states and 8200 transitions. [2025-01-09 04:50:52,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 04:50:52,103 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:52,103 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:52,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 04:50:52,103 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:52,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:52,104 INFO L85 PathProgramCache]: Analyzing trace with hash 385846987, now seen corresponding path program 1 times [2025-01-09 04:50:52,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:52,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184430273] [2025-01-09 04:50:52,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:52,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:52,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 04:50:52,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 04:50:52,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:52,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:52,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:52,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:52,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184430273] [2025-01-09 04:50:52,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184430273] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:52,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:52,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:50:52,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937642727] [2025-01-09 04:50:52,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:52,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:50:52,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:52,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:50:52,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:50:52,188 INFO L87 Difference]: Start difference. First operand 5697 states and 8200 transitions. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:52,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:52,435 INFO L93 Difference]: Finished difference Result 21041 states and 30532 transitions. [2025-01-09 04:50:52,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:50:52,436 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2025-01-09 04:50:52,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:52,451 INFO L225 Difference]: With dead ends: 21041 [2025-01-09 04:50:52,452 INFO L226 Difference]: Without dead ends: 15469 [2025-01-09 04:50:52,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:50:52,461 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 934 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:52,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 340 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:50:52,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15469 states. [2025-01-09 04:50:52,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15469 to 12267. [2025-01-09 04:50:52,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12267 states, 12266 states have (on average 1.440159791293005) internal successors, (17665), 12266 states have internal predecessors, (17665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:52,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12267 states to 12267 states and 17665 transitions. [2025-01-09 04:50:52,608 INFO L78 Accepts]: Start accepts. Automaton has 12267 states and 17665 transitions. Word has length 119 [2025-01-09 04:50:52,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:52,608 INFO L471 AbstractCegarLoop]: Abstraction has 12267 states and 17665 transitions. [2025-01-09 04:50:52,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:52,608 INFO L276 IsEmpty]: Start isEmpty. Operand 12267 states and 17665 transitions. [2025-01-09 04:50:52,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 04:50:52,609 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:52,610 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:50:52,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 04:50:52,610 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:52,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:52,611 INFO L85 PathProgramCache]: Analyzing trace with hash -697568714, now seen corresponding path program 1 times [2025-01-09 04:50:52,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:52,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162791720] [2025-01-09 04:50:52,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:52,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:52,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 04:50:52,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 04:50:52,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:52,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:52,704 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:52,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:52,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162791720] [2025-01-09 04:50:52,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162791720] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:52,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:52,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:50:52,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10368493] [2025-01-09 04:50:52,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:52,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:50:52,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:52,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:50:52,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:50:52,706 INFO L87 Difference]: Start difference. First operand 12267 states and 17665 transitions. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:52,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:52,978 INFO L93 Difference]: Finished difference Result 40951 states and 59127 transitions. [2025-01-09 04:50:52,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:50:52,979 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2025-01-09 04:50:52,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:53,012 INFO L225 Difference]: With dead ends: 40951 [2025-01-09 04:50:53,013 INFO L226 Difference]: Without dead ends: 28809 [2025-01-09 04:50:53,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:50:53,033 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 849 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:53,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 338 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:50:53,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28809 states. [2025-01-09 04:50:53,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28809 to 26407. [2025-01-09 04:50:53,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26407 states, 26406 states have (on average 1.4388775278345831) internal successors, (37995), 26406 states have internal predecessors, (37995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:53,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26407 states to 26407 states and 37995 transitions. [2025-01-09 04:50:53,309 INFO L78 Accepts]: Start accepts. Automaton has 26407 states and 37995 transitions. Word has length 119 [2025-01-09 04:50:53,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:53,309 INFO L471 AbstractCegarLoop]: Abstraction has 26407 states and 37995 transitions. [2025-01-09 04:50:53,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:53,310 INFO L276 IsEmpty]: Start isEmpty. Operand 26407 states and 37995 transitions. [2025-01-09 04:50:53,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 04:50:53,311 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:53,311 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:50:53,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 04:50:53,311 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:53,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:53,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1186578114, now seen corresponding path program 1 times [2025-01-09 04:50:53,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:53,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138132618] [2025-01-09 04:50:53,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:53,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:53,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 04:50:53,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 04:50:53,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:53,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:53,443 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:53,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:53,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138132618] [2025-01-09 04:50:53,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138132618] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:53,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:53,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:50:53,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131612458] [2025-01-09 04:50:53,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:53,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:50:53,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:53,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:50:53,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:50:53,446 INFO L87 Difference]: Start difference. First operand 26407 states and 37995 transitions. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:53,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:53,782 INFO L93 Difference]: Finished difference Result 98971 states and 143317 transitions. [2025-01-09 04:50:53,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:50:53,783 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2025-01-09 04:50:53,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:53,859 INFO L225 Difference]: With dead ends: 98971 [2025-01-09 04:50:53,859 INFO L226 Difference]: Without dead ends: 72689 [2025-01-09 04:50:53,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:50:53,893 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 1019 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:53,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 342 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:50:53,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72689 states. [2025-01-09 04:50:54,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72689 to 56687. [2025-01-09 04:50:54,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56687 states, 56686 states have (on average 1.4369509226263981) internal successors, (81455), 56686 states have internal predecessors, (81455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:54,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56687 states to 56687 states and 81455 transitions. [2025-01-09 04:50:54,530 INFO L78 Accepts]: Start accepts. Automaton has 56687 states and 81455 transitions. Word has length 119 [2025-01-09 04:50:54,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:54,530 INFO L471 AbstractCegarLoop]: Abstraction has 56687 states and 81455 transitions. [2025-01-09 04:50:54,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:54,531 INFO L276 IsEmpty]: Start isEmpty. Operand 56687 states and 81455 transitions. [2025-01-09 04:50:54,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 04:50:54,532 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:54,532 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:50:54,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 04:50:54,532 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:54,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:54,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1142705720, now seen corresponding path program 1 times [2025-01-09 04:50:54,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:54,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238446202] [2025-01-09 04:50:54,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:54,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:54,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 04:50:54,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 04:50:54,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:54,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:54,616 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:54,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:54,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238446202] [2025-01-09 04:50:54,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238446202] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:54,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:54,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:50:54,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682670111] [2025-01-09 04:50:54,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:54,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:50:54,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:54,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:50:54,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:50:54,617 INFO L87 Difference]: Start difference. First operand 56687 states and 81455 transitions. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:55,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:55,259 INFO L93 Difference]: Finished difference Result 128617 states and 185270 transitions. [2025-01-09 04:50:55,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:50:55,263 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2025-01-09 04:50:55,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:55,349 INFO L225 Difference]: With dead ends: 128617 [2025-01-09 04:50:55,349 INFO L226 Difference]: Without dead ends: 72055 [2025-01-09 04:50:55,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:50:55,388 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 903 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:55,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 390 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:50:55,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72055 states. [2025-01-09 04:50:56,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72055 to 60449. [2025-01-09 04:50:56,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60449 states, 60448 states have (on average 1.433959767072525) internal successors, (86680), 60448 states have internal predecessors, (86680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:56,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60449 states to 60449 states and 86680 transitions. [2025-01-09 04:50:56,160 INFO L78 Accepts]: Start accepts. Automaton has 60449 states and 86680 transitions. Word has length 119 [2025-01-09 04:50:56,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:56,160 INFO L471 AbstractCegarLoop]: Abstraction has 60449 states and 86680 transitions. [2025-01-09 04:50:56,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:56,161 INFO L276 IsEmpty]: Start isEmpty. Operand 60449 states and 86680 transitions. [2025-01-09 04:50:56,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 04:50:56,177 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:56,177 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:50:56,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 04:50:56,177 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:56,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:56,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1758398810, now seen corresponding path program 1 times [2025-01-09 04:50:56,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:56,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130930558] [2025-01-09 04:50:56,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:56,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:56,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 04:50:56,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 04:50:56,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:56,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:56,456 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 04:50:56,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:56,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130930558] [2025-01-09 04:50:56,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130930558] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:56,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:56,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:50:56,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002195811] [2025-01-09 04:50:56,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:56,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:50:56,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:56,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:50:56,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:50:56,457 INFO L87 Difference]: Start difference. First operand 60449 states and 86680 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:56,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:56,803 INFO L93 Difference]: Finished difference Result 116533 states and 166770 transitions. [2025-01-09 04:50:56,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:50:56,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 146 [2025-01-09 04:50:56,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:56,873 INFO L225 Difference]: With dead ends: 116533 [2025-01-09 04:50:56,874 INFO L226 Difference]: Without dead ends: 56221 [2025-01-09 04:50:56,910 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:50:56,910 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 76 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:56,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 384 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:50:56,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56221 states. [2025-01-09 04:50:57,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56221 to 54959. [2025-01-09 04:50:57,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54959 states, 54958 states have (on average 1.4202663852396376) internal successors, (78055), 54958 states have internal predecessors, (78055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:57,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54959 states to 54959 states and 78055 transitions. [2025-01-09 04:50:57,869 INFO L78 Accepts]: Start accepts. Automaton has 54959 states and 78055 transitions. Word has length 146 [2025-01-09 04:50:57,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:57,869 INFO L471 AbstractCegarLoop]: Abstraction has 54959 states and 78055 transitions. [2025-01-09 04:50:57,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:57,869 INFO L276 IsEmpty]: Start isEmpty. Operand 54959 states and 78055 transitions. [2025-01-09 04:50:57,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 04:50:57,876 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:57,876 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:50:57,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 04:50:57,876 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:57,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:57,877 INFO L85 PathProgramCache]: Analyzing trace with hash 499601549, now seen corresponding path program 1 times [2025-01-09 04:50:57,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:57,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976957926] [2025-01-09 04:50:57,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:57,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:57,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 04:50:57,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 04:50:57,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:57,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:58,005 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 04:50:58,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:58,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976957926] [2025-01-09 04:50:58,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976957926] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:58,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:58,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:50:58,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278366619] [2025-01-09 04:50:58,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:58,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:50:58,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:58,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:50:58,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:50:58,009 INFO L87 Difference]: Start difference. First operand 54959 states and 78055 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:58,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:58,326 INFO L93 Difference]: Finished difference Result 105595 states and 149577 transitions. [2025-01-09 04:50:58,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:50:58,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 147 [2025-01-09 04:50:58,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:58,384 INFO L225 Difference]: With dead ends: 105595 [2025-01-09 04:50:58,384 INFO L226 Difference]: Without dead ends: 50761 [2025-01-09 04:50:58,413 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:50:58,413 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 69 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:58,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 385 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:50:58,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50761 states. [2025-01-09 04:50:58,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50761 to 49559. [2025-01-09 04:50:58,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49559 states, 49558 states have (on average 1.405524839581904) internal successors, (69655), 49558 states have internal predecessors, (69655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:59,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49559 states to 49559 states and 69655 transitions. [2025-01-09 04:50:59,014 INFO L78 Accepts]: Start accepts. Automaton has 49559 states and 69655 transitions. Word has length 147 [2025-01-09 04:50:59,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:50:59,014 INFO L471 AbstractCegarLoop]: Abstraction has 49559 states and 69655 transitions. [2025-01-09 04:50:59,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:59,014 INFO L276 IsEmpty]: Start isEmpty. Operand 49559 states and 69655 transitions. [2025-01-09 04:50:59,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 04:50:59,020 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:50:59,020 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:50:59,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 04:50:59,020 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:50:59,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:50:59,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1117188085, now seen corresponding path program 1 times [2025-01-09 04:50:59,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:50:59,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794693030] [2025-01-09 04:50:59,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:50:59,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:50:59,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 04:50:59,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 04:50:59,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:50:59,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:50:59,301 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 04:50:59,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:50:59,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794693030] [2025-01-09 04:50:59,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794693030] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:50:59,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:50:59,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:50:59,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890907652] [2025-01-09 04:50:59,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:50:59,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:50:59,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:59,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:50:59,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:50:59,303 INFO L87 Difference]: Start difference. First operand 49559 states and 69655 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:59,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:59,519 INFO L93 Difference]: Finished difference Result 94795 states and 132777 transitions. [2025-01-09 04:50:59,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:50:59,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 148 [2025-01-09 04:50:59,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:59,572 INFO L225 Difference]: With dead ends: 94795 [2025-01-09 04:50:59,572 INFO L226 Difference]: Without dead ends: 45361 [2025-01-09 04:50:59,606 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:50:59,606 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 62 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:59,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 386 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:50:59,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45361 states. [2025-01-09 04:51:00,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45361 to 44159. [2025-01-09 04:51:00,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44159 states, 44158 states have (on average 1.3871778613161827) internal successors, (61255), 44158 states have internal predecessors, (61255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:00,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44159 states to 44159 states and 61255 transitions. [2025-01-09 04:51:00,273 INFO L78 Accepts]: Start accepts. Automaton has 44159 states and 61255 transitions. Word has length 148 [2025-01-09 04:51:00,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:00,273 INFO L471 AbstractCegarLoop]: Abstraction has 44159 states and 61255 transitions. [2025-01-09 04:51:00,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:00,273 INFO L276 IsEmpty]: Start isEmpty. Operand 44159 states and 61255 transitions. [2025-01-09 04:51:00,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 04:51:00,279 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:00,280 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:00,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 04:51:00,280 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:00,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:00,281 INFO L85 PathProgramCache]: Analyzing trace with hash 952389854, now seen corresponding path program 1 times [2025-01-09 04:51:00,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:00,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972932364] [2025-01-09 04:51:00,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:00,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:00,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 04:51:00,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 04:51:00,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:00,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:00,360 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 04:51:00,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:00,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972932364] [2025-01-09 04:51:00,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972932364] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:51:00,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:51:00,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:51:00,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579331232] [2025-01-09 04:51:00,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:51:00,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:51:00,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:00,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:51:00,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:51:00,361 INFO L87 Difference]: Start difference. First operand 44159 states and 61255 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:00,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:00,564 INFO L93 Difference]: Finished difference Result 127827 states and 176297 transitions. [2025-01-09 04:51:00,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:51:00,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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 149 [2025-01-09 04:51:00,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:00,652 INFO L225 Difference]: With dead ends: 127827 [2025-01-09 04:51:00,653 INFO L226 Difference]: Without dead ends: 83793 [2025-01-09 04:51:00,700 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:51:00,701 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 55 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:00,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 387 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:51:00,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83793 states. [2025-01-09 04:51:01,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83793 to 78191. [2025-01-09 04:51:01,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78191 states, 78190 states have (on average 1.3706995779511446) internal successors, (107175), 78190 states have internal predecessors, (107175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:01,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78191 states to 78191 states and 107175 transitions. [2025-01-09 04:51:01,761 INFO L78 Accepts]: Start accepts. Automaton has 78191 states and 107175 transitions. Word has length 149 [2025-01-09 04:51:01,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:01,762 INFO L471 AbstractCegarLoop]: Abstraction has 78191 states and 107175 transitions. [2025-01-09 04:51:01,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:01,762 INFO L276 IsEmpty]: Start isEmpty. Operand 78191 states and 107175 transitions. [2025-01-09 04:51:01,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 04:51:01,766 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:01,766 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:01,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 04:51:01,767 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:01,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:01,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1548944632, now seen corresponding path program 1 times [2025-01-09 04:51:01,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:01,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606245348] [2025-01-09 04:51:01,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:01,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:01,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 04:51:01,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 04:51:01,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:01,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:02,454 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:51:02,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:02,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606245348] [2025-01-09 04:51:02,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606245348] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:51:02,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267861909] [2025-01-09 04:51:02,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:02,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:51:02,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:51:02,462 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:51:02,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 04:51:02,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 04:51:02,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 04:51:02,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:02,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:02,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 04:51:02,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:51:03,936 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:51:03,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:51:06,052 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:51:06,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267861909] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:51:06,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:51:06,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2025-01-09 04:51:06,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920779307] [2025-01-09 04:51:06,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:51:06,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 04:51:06,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:06,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 04:51:06,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2025-01-09 04:51:06,054 INFO L87 Difference]: Start difference. First operand 78191 states and 107175 transitions. Second operand has 26 states, 26 states have (on average 13.115384615384615) internal successors, (341), 25 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:07,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:07,966 INFO L93 Difference]: Finished difference Result 333479 states and 457434 transitions. [2025-01-09 04:51:07,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 04:51:07,967 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 13.115384615384615) internal successors, (341), 25 states have internal predecessors, (341), 0 states have call successors, (0), 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 150 [2025-01-09 04:51:07,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:08,347 INFO L225 Difference]: With dead ends: 333479 [2025-01-09 04:51:08,347 INFO L226 Difference]: Without dead ends: 255413 [2025-01-09 04:51:08,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=487, Invalid=1675, Unknown=0, NotChecked=0, Total=2162 [2025-01-09 04:51:08,435 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 2651 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2651 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 1273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:08,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2651 Valid, 1333 Invalid, 1273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:51:08,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255413 states. [2025-01-09 04:51:11,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255413 to 186357. [2025-01-09 04:51:11,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186357 states, 186356 states have (on average 1.3669052780699307) internal successors, (254731), 186356 states have internal predecessors, (254731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:11,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186357 states to 186357 states and 254731 transitions. [2025-01-09 04:51:11,727 INFO L78 Accepts]: Start accepts. Automaton has 186357 states and 254731 transitions. Word has length 150 [2025-01-09 04:51:11,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:51:11,727 INFO L471 AbstractCegarLoop]: Abstraction has 186357 states and 254731 transitions. [2025-01-09 04:51:11,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 13.115384615384615) internal successors, (341), 25 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:11,727 INFO L276 IsEmpty]: Start isEmpty. Operand 186357 states and 254731 transitions. [2025-01-09 04:51:11,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 04:51:11,740 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:51:11,740 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:11,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 04:51:11,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-01-09 04:51:11,944 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:51:11,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:51:11,946 INFO L85 PathProgramCache]: Analyzing trace with hash -2108338345, now seen corresponding path program 1 times [2025-01-09 04:51:11,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:51:11,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330176582] [2025-01-09 04:51:11,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:11,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:51:11,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 04:51:12,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 04:51:12,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:12,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:12,623 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:51:12,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:51:12,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330176582] [2025-01-09 04:51:12,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330176582] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:51:12,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869214185] [2025-01-09 04:51:12,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:51:12,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:51:12,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:51:12,626 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:51:12,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 04:51:13,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 04:51:13,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 04:51:13,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:51:13,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:51:13,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 04:51:13,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:51:14,707 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:51:14,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:51:16,422 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:51:16,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869214185] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:51:16,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:51:16,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2025-01-09 04:51:16,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835995850] [2025-01-09 04:51:16,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:51:16,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-09 04:51:16,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:51:16,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-09 04:51:16,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=764, Unknown=0, NotChecked=0, Total=870 [2025-01-09 04:51:16,424 INFO L87 Difference]: Start difference. First operand 186357 states and 254731 transitions. Second operand has 30 states, 30 states have (on average 14.033333333333333) internal successors, (421), 29 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:51:28,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:51:28,326 INFO L93 Difference]: Finished difference Result 1532980 states and 2077312 transitions. [2025-01-09 04:51:28,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2025-01-09 04:51:28,327 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 14.033333333333333) internal successors, (421), 29 states have internal predecessors, (421), 0 states have call successors, (0), 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 151 [2025-01-09 04:51:28,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:51:30,677 INFO L225 Difference]: With dead ends: 1532980 [2025-01-09 04:51:30,677 INFO L226 Difference]: Without dead ends: 1346798 [2025-01-09 04:51:31,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12035 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=4286, Invalid=30496, Unknown=0, NotChecked=0, Total=34782 [2025-01-09 04:51:31,334 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 6581 mSDsluCounter, 3161 mSDsCounter, 0 mSdLazyCounter, 4080 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6581 SdHoareTripleChecker+Valid, 3372 SdHoareTripleChecker+Invalid, 4165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 4080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 04:51:31,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6581 Valid, 3372 Invalid, 4165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 4080 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 04:51:31,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346798 states. [2025-01-09 04:51:42,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346798 to 745911. [2025-01-09 04:51:43,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745911 states, 745910 states have (on average 1.3552050515477738) internal successors, (1010861), 745910 states have internal predecessors, (1010861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)