./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_two_p2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_two_p2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 8026e8fad442d359c5ad25f6b8e6c64a8eb4f5fda678822051ba0bded2a5b47e --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:13:55,574 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:13:55,615 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 00:13:55,620 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:13:55,623 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:13:55,641 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:13:55,642 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:13:55,642 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:13:55,642 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:13:55,643 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:13:55,643 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:13:55,643 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:13:55,644 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:13:55,644 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:13:55,644 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:13:55,644 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:13:55,644 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:13:55,645 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:13:55,645 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:13:55,645 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:13:55,645 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:13:55,645 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:13:55,645 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:13:55,645 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:13:55,645 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:13:55,645 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:13:55,645 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:13:55,645 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:13:55,645 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:13:55,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:13:55,646 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:13:55,646 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:13:55,646 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:13:55,646 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:13:55,646 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:13:55,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:13:55,646 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:13:55,646 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:13:55,646 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:13:55,646 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:13:55,646 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8026e8fad442d359c5ad25f6b8e6c64a8eb4f5fda678822051ba0bded2a5b47e [2025-02-08 00:13:55,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:13:55,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:13:55,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:13:55,854 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:13:55,854 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:13:55,855 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_two_p2.c [2025-02-08 00:13:56,993 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b69fe71c/fc04d5ddd18040f8a656ae56f5ce558f/FLAGc1652f99f [2025-02-08 00:13:57,299 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:13:57,300 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_two_p2.c [2025-02-08 00:13:57,313 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b69fe71c/fc04d5ddd18040f8a656ae56f5ce558f/FLAGc1652f99f [2025-02-08 00:13:57,549 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b69fe71c/fc04d5ddd18040f8a656ae56f5ce558f [2025-02-08 00:13:57,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:13:57,552 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:13:57,553 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:13:57,553 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:13:57,560 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:13:57,561 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:13:57" (1/1) ... [2025-02-08 00:13:57,561 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@715d2a94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:57, skipping insertion in model container [2025-02-08 00:13:57,562 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:13:57" (1/1) ... [2025-02-08 00:13:57,593 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:13:57,747 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_two_p2.c[1257,1270] [2025-02-08 00:13:57,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:13:57,988 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:13:57,995 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_two_p2.c[1257,1270] [2025-02-08 00:13:58,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:13:58,111 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:13:58,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:58 WrapperNode [2025-02-08 00:13:58,112 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:13:58,113 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:13:58,113 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:13:58,114 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:13:58,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:58" (1/1) ... [2025-02-08 00:13:58,166 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:58" (1/1) ... [2025-02-08 00:13:58,431 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3696 [2025-02-08 00:13:58,431 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:13:58,432 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:13:58,432 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:13:58,432 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:13:58,438 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:58" (1/1) ... [2025-02-08 00:13:58,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:58" (1/1) ... [2025-02-08 00:13:58,581 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:58" (1/1) ... [2025-02-08 00:13:58,664 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-02-08 00:13:58,664 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:58" (1/1) ... [2025-02-08 00:13:58,664 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:58" (1/1) ... [2025-02-08 00:13:58,785 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:58" (1/1) ... [2025-02-08 00:13:58,802 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:58" (1/1) ... [2025-02-08 00:13:58,834 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:58" (1/1) ... [2025-02-08 00:13:58,865 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:58" (1/1) ... [2025-02-08 00:13:58,929 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:13:58,931 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:13:58,931 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:13:58,931 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:13:58,932 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:58" (1/1) ... [2025-02-08 00:13:58,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:13:58,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:13:58,996 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-02-08 00:13:59,005 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-02-08 00:13:59,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:13:59,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:13:59,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:13:59,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:13:59,374 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:13:59,375 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:14:01,838 INFO L? ?]: Removed 2339 outVars from TransFormulas that were not future-live. [2025-02-08 00:14:01,839 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:14:01,963 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:14:01,966 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:14:01,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:14:01 BoogieIcfgContainer [2025-02-08 00:14:01,967 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:14:01,969 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:14:01,969 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:14:01,973 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:14:01,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:13:57" (1/3) ... [2025-02-08 00:14:01,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b505df3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:14:01, skipping insertion in model container [2025-02-08 00:14:01,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:58" (2/3) ... [2025-02-08 00:14:01,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b505df3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:14:01, skipping insertion in model container [2025-02-08 00:14:01,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:14:01" (3/3) ... [2025-02-08 00:14:01,975 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_two_p2.c [2025-02-08 00:14:01,987 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:14:01,988 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_two_p2.c that has 1 procedures, 1039 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:14:02,052 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:14:02,063 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;@63621108, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:14:02,063 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:14:02,069 INFO L276 IsEmpty]: Start isEmpty. Operand has 1039 states, 1037 states have (on average 1.5033751205400192) internal successors, (1559), 1038 states have internal predecessors, (1559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:02,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-08 00:14:02,082 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:14:02,083 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:14:02,083 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:14:02,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:14:02,088 INFO L85 PathProgramCache]: Analyzing trace with hash -2010345758, now seen corresponding path program 1 times [2025-02-08 00:14:02,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:14:02,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322661380] [2025-02-08 00:14:02,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:02,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:14:02,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-08 00:14:02,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-08 00:14:02,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:02,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:03,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:14:03,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:14:03,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322661380] [2025-02-08 00:14:03,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322661380] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:14:03,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:14:03,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:14:03,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787075422] [2025-02-08 00:14:03,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:14:03,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:14:03,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:14:03,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:14:03,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:14:03,917 INFO L87 Difference]: Start difference. First operand has 1039 states, 1037 states have (on average 1.5033751205400192) internal successors, (1559), 1038 states have internal predecessors, (1559), 0 states have call successors, (0), 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 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:04,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:14:04,554 INFO L93 Difference]: Finished difference Result 2037 states and 3059 transitions. [2025-02-08 00:14:04,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:14:04,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2025-02-08 00:14:04,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:14:04,573 INFO L225 Difference]: With dead ends: 2037 [2025-02-08 00:14:04,574 INFO L226 Difference]: Without dead ends: 1039 [2025-02-08 00:14:04,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:14:04,579 INFO L435 NwaCegarLoop]: 1298 mSDtfsCounter, 0 mSDsluCounter, 2591 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3889 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 00:14:04,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3889 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 00:14:04,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2025-02-08 00:14:04,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 1039. [2025-02-08 00:14:04,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1039 states, 1038 states have (on average 1.5009633911368014) internal successors, (1558), 1038 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:04,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1558 transitions. [2025-02-08 00:14:04,657 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1558 transitions. Word has length 154 [2025-02-08 00:14:04,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:14:04,658 INFO L471 AbstractCegarLoop]: Abstraction has 1039 states and 1558 transitions. [2025-02-08 00:14:04,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:04,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1558 transitions. [2025-02-08 00:14:04,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-08 00:14:04,660 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:14:04,660 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:14:04,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:14:04,660 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:14:04,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:14:04,661 INFO L85 PathProgramCache]: Analyzing trace with hash 2108471352, now seen corresponding path program 1 times [2025-02-08 00:14:04,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:14:04,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807793820] [2025-02-08 00:14:04,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:04,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:14:04,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-08 00:14:04,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-08 00:14:04,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:04,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:05,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:14:05,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:14:05,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807793820] [2025-02-08 00:14:05,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807793820] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:14:05,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:14:05,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:14:05,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231653423] [2025-02-08 00:14:05,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:14:05,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:14:05,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:14:05,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:14:05,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:14:05,322 INFO L87 Difference]: Start difference. First operand 1039 states and 1558 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:05,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:14:05,773 INFO L93 Difference]: Finished difference Result 2039 states and 3058 transitions. [2025-02-08 00:14:05,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:14:05,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2025-02-08 00:14:05,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:14:05,778 INFO L225 Difference]: With dead ends: 2039 [2025-02-08 00:14:05,779 INFO L226 Difference]: Without dead ends: 1041 [2025-02-08 00:14:05,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:14:05,780 INFO L435 NwaCegarLoop]: 1298 mSDtfsCounter, 0 mSDsluCounter, 2588 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3886 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:14:05,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3886 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:14:05,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2025-02-08 00:14:05,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1041. [2025-02-08 00:14:05,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1041 states, 1040 states have (on average 1.5) internal successors, (1560), 1040 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:05,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1560 transitions. [2025-02-08 00:14:05,794 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1560 transitions. Word has length 155 [2025-02-08 00:14:05,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:14:05,794 INFO L471 AbstractCegarLoop]: Abstraction has 1041 states and 1560 transitions. [2025-02-08 00:14:05,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:05,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1560 transitions. [2025-02-08 00:14:05,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-08 00:14:05,796 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:14:05,796 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:14:05,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:14:05,796 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:14:05,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:14:05,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1425354339, now seen corresponding path program 1 times [2025-02-08 00:14:05,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:14:05,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593057587] [2025-02-08 00:14:05,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:05,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:14:05,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-08 00:14:08,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-08 00:14:08,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:08,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:12,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-02-08 00:14:12,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:14:12,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593057587] [2025-02-08 00:14:12,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593057587] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:14:12,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:14:12,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:14:12,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608503978] [2025-02-08 00:14:12,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:14:12,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:14:12,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:14:12,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:14:12,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:14:12,452 INFO L87 Difference]: Start difference. First operand 1041 states and 1560 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:13,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:14:13,640 INFO L93 Difference]: Finished difference Result 2497 states and 3742 transitions. [2025-02-08 00:14:13,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:14:13,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156 [2025-02-08 00:14:13,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:14:13,648 INFO L225 Difference]: With dead ends: 2497 [2025-02-08 00:14:13,649 INFO L226 Difference]: Without dead ends: 1497 [2025-02-08 00:14:13,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:14:13,653 INFO L435 NwaCegarLoop]: 1166 mSDtfsCounter, 651 mSDsluCounter, 3473 mSDsCounter, 0 mSdLazyCounter, 1524 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 4639 SdHoareTripleChecker+Invalid, 1524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:14:13,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 4639 Invalid, 1524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1524 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-08 00:14:13,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2025-02-08 00:14:13,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1182. [2025-02-08 00:14:13,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 1181 states have (on average 1.5004233700254022) internal successors, (1772), 1181 states have internal predecessors, (1772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:13,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1772 transitions. [2025-02-08 00:14:13,683 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1772 transitions. Word has length 156 [2025-02-08 00:14:13,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:14:13,683 INFO L471 AbstractCegarLoop]: Abstraction has 1182 states and 1772 transitions. [2025-02-08 00:14:13,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:13,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1772 transitions. [2025-02-08 00:14:13,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-08 00:14:13,685 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:14:13,685 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:14:13,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:14:13,686 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:14:13,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:14:13,687 INFO L85 PathProgramCache]: Analyzing trace with hash -576705135, now seen corresponding path program 1 times [2025-02-08 00:14:13,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:14:13,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983880932] [2025-02-08 00:14:13,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:13,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:14:13,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-08 00:14:15,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-08 00:14:15,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:15,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:16,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:14:16,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:14:16,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983880932] [2025-02-08 00:14:16,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983880932] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:14:16,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:14:16,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:14:16,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613538807] [2025-02-08 00:14:16,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:14:16,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:14:16,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:14:16,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:14:16,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:14:16,559 INFO L87 Difference]: Start difference. First operand 1182 states and 1772 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:17,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:14:17,621 INFO L93 Difference]: Finished difference Result 2801 states and 4197 transitions. [2025-02-08 00:14:17,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:14:17,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2025-02-08 00:14:17,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:14:17,635 INFO L225 Difference]: With dead ends: 2801 [2025-02-08 00:14:17,639 INFO L226 Difference]: Without dead ends: 1801 [2025-02-08 00:14:17,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:14:17,642 INFO L435 NwaCegarLoop]: 1159 mSDtfsCounter, 1105 mSDsluCounter, 3457 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1105 SdHoareTripleChecker+Valid, 4616 SdHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 00:14:17,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1105 Valid, 4616 Invalid, 1547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1547 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 00:14:17,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states. [2025-02-08 00:14:17,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1183. [2025-02-08 00:14:17,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.5) internal successors, (1773), 1182 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:17,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1773 transitions. [2025-02-08 00:14:17,679 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1773 transitions. Word has length 157 [2025-02-08 00:14:17,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:14:17,684 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1773 transitions. [2025-02-08 00:14:17,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:17,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1773 transitions. [2025-02-08 00:14:17,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-08 00:14:17,688 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:14:17,689 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:14:17,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:14:17,689 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:14:17,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:14:17,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1394196563, now seen corresponding path program 1 times [2025-02-08 00:14:17,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:14:17,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335340442] [2025-02-08 00:14:17,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:17,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:14:17,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-08 00:14:19,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-08 00:14:19,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:19,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:20,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:14:20,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:14:20,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335340442] [2025-02-08 00:14:20,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335340442] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:14:20,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:14:20,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:14:20,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685783986] [2025-02-08 00:14:20,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:14:20,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:14:20,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:14:20,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:14:20,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:14:20,710 INFO L87 Difference]: Start difference. First operand 1183 states and 1773 transitions. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 5 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:21,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:14:21,739 INFO L93 Difference]: Finished difference Result 2642 states and 3956 transitions. [2025-02-08 00:14:21,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:14:21,739 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 5 states have internal predecessors, (158), 0 states have call successors, (0), 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 158 [2025-02-08 00:14:21,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:14:21,743 INFO L225 Difference]: With dead ends: 2642 [2025-02-08 00:14:21,743 INFO L226 Difference]: Without dead ends: 1569 [2025-02-08 00:14:21,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:14:21,745 INFO L435 NwaCegarLoop]: 1263 mSDtfsCounter, 869 mSDsluCounter, 4890 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 6153 SdHoareTripleChecker+Invalid, 1568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 00:14:21,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 6153 Invalid, 1568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 00:14:21,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2025-02-08 00:14:21,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1183. [2025-02-08 00:14:21,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.4991539763113366) internal successors, (1772), 1182 states have internal predecessors, (1772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:21,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1772 transitions. [2025-02-08 00:14:21,763 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1772 transitions. Word has length 158 [2025-02-08 00:14:21,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:14:21,763 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1772 transitions. [2025-02-08 00:14:21,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 5 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:21,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1772 transitions. [2025-02-08 00:14:21,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-08 00:14:21,765 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:14:21,765 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:14:21,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 00:14:21,765 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:14:21,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:14:21,765 INFO L85 PathProgramCache]: Analyzing trace with hash -131756384, now seen corresponding path program 1 times [2025-02-08 00:14:21,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:14:21,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028078985] [2025-02-08 00:14:21,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:21,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:14:21,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-08 00:14:23,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-08 00:14:23,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:23,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:24,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:14:24,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:14:24,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028078985] [2025-02-08 00:14:24,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028078985] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:14:24,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:14:24,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:14:24,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888641715] [2025-02-08 00:14:24,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:14:24,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:14:24,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:14:24,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:14:24,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:14:24,474 INFO L87 Difference]: Start difference. First operand 1183 states and 1772 transitions. Second operand has 6 states, 6 states have (on average 26.5) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:25,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:14:25,296 INFO L93 Difference]: Finished difference Result 2681 states and 4014 transitions. [2025-02-08 00:14:25,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:14:25,296 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2025-02-08 00:14:25,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:14:25,301 INFO L225 Difference]: With dead ends: 2681 [2025-02-08 00:14:25,301 INFO L226 Difference]: Without dead ends: 1497 [2025-02-08 00:14:25,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:14:25,303 INFO L435 NwaCegarLoop]: 1263 mSDtfsCounter, 3153 mSDsluCounter, 3692 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3153 SdHoareTripleChecker+Valid, 4955 SdHoareTripleChecker+Invalid, 1272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 00:14:25,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3153 Valid, 4955 Invalid, 1272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 00:14:25,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2025-02-08 00:14:25,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1183. [2025-02-08 00:14:25,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.4983079526226735) internal successors, (1771), 1182 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:25,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1771 transitions. [2025-02-08 00:14:25,320 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1771 transitions. Word has length 159 [2025-02-08 00:14:25,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:14:25,320 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1771 transitions. [2025-02-08 00:14:25,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:25,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1771 transitions. [2025-02-08 00:14:25,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-08 00:14:25,323 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:14:25,323 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:14:25,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 00:14:25,324 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:14:25,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:14:25,324 INFO L85 PathProgramCache]: Analyzing trace with hash 798880907, now seen corresponding path program 1 times [2025-02-08 00:14:25,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:14:25,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950586724] [2025-02-08 00:14:25,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:25,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:14:25,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-08 00:14:26,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-08 00:14:26,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:26,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:27,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:14:27,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:14:27,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950586724] [2025-02-08 00:14:27,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950586724] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:14:27,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:14:27,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:14:27,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136391040] [2025-02-08 00:14:27,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:14:27,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:14:27,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:14:27,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:14:27,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:14:27,556 INFO L87 Difference]: Start difference. First operand 1183 states and 1771 transitions. Second operand has 5 states, 5 states have (on average 32.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:28,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:14:28,491 INFO L93 Difference]: Finished difference Result 2765 states and 4139 transitions. [2025-02-08 00:14:28,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:14:28,492 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2025-02-08 00:14:28,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:14:28,496 INFO L225 Difference]: With dead ends: 2765 [2025-02-08 00:14:28,496 INFO L226 Difference]: Without dead ends: 1721 [2025-02-08 00:14:28,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:14:28,498 INFO L435 NwaCegarLoop]: 1164 mSDtfsCounter, 1003 mSDsluCounter, 3459 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1003 SdHoareTripleChecker+Valid, 4623 SdHoareTripleChecker+Invalid, 1540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 00:14:28,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1003 Valid, 4623 Invalid, 1540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 00:14:28,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2025-02-08 00:14:28,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1183. [2025-02-08 00:14:28,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.49746192893401) internal successors, (1770), 1182 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:28,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1770 transitions. [2025-02-08 00:14:28,515 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1770 transitions. Word has length 160 [2025-02-08 00:14:28,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:14:28,516 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1770 transitions. [2025-02-08 00:14:28,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:28,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1770 transitions. [2025-02-08 00:14:28,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-08 00:14:28,517 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:14:28,517 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:14:28,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 00:14:28,517 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:14:28,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:14:28,517 INFO L85 PathProgramCache]: Analyzing trace with hash -690456665, now seen corresponding path program 1 times [2025-02-08 00:14:28,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:14:28,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636027373] [2025-02-08 00:14:28,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:28,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:14:28,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-08 00:14:29,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-08 00:14:29,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:29,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:30,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:14:30,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:14:30,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636027373] [2025-02-08 00:14:30,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636027373] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:14:30,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:14:30,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:14:30,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718858484] [2025-02-08 00:14:30,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:14:30,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:14:30,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:14:30,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:14:30,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:14:30,965 INFO L87 Difference]: Start difference. First operand 1183 states and 1770 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 5 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:32,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:14:32,006 INFO L93 Difference]: Finished difference Result 2822 states and 4222 transitions. [2025-02-08 00:14:32,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:14:32,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 5 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2025-02-08 00:14:32,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:14:32,012 INFO L225 Difference]: With dead ends: 2822 [2025-02-08 00:14:32,014 INFO L226 Difference]: Without dead ends: 1811 [2025-02-08 00:14:32,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:14:32,017 INFO L435 NwaCegarLoop]: 1216 mSDtfsCounter, 1117 mSDsluCounter, 4749 mSDsCounter, 0 mSdLazyCounter, 1796 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1117 SdHoareTripleChecker+Valid, 5965 SdHoareTripleChecker+Invalid, 1797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 00:14:32,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1117 Valid, 5965 Invalid, 1797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1796 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 00:14:32,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2025-02-08 00:14:32,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1183. [2025-02-08 00:14:32,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.496615905245347) internal successors, (1769), 1182 states have internal predecessors, (1769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:32,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1769 transitions. [2025-02-08 00:14:32,036 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1769 transitions. Word has length 161 [2025-02-08 00:14:32,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:14:32,037 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1769 transitions. [2025-02-08 00:14:32,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 5 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:32,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1769 transitions. [2025-02-08 00:14:32,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-08 00:14:32,039 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:14:32,039 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:14:32,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 00:14:32,040 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:14:32,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:14:32,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1854222498, now seen corresponding path program 1 times [2025-02-08 00:14:32,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:14:32,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297403276] [2025-02-08 00:14:32,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:32,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:14:32,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-08 00:14:33,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-08 00:14:33,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:33,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:34,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:14:34,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:14:34,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297403276] [2025-02-08 00:14:34,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297403276] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:14:34,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:14:34,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:14:34,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321593106] [2025-02-08 00:14:34,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:14:34,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:14:34,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:14:34,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:14:34,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:14:34,956 INFO L87 Difference]: Start difference. First operand 1183 states and 1769 transitions. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 5 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:35,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:14:35,977 INFO L93 Difference]: Finished difference Result 2811 states and 4206 transitions. [2025-02-08 00:14:35,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:14:35,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 5 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 162 [2025-02-08 00:14:35,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:14:35,981 INFO L225 Difference]: With dead ends: 2811 [2025-02-08 00:14:35,981 INFO L226 Difference]: Without dead ends: 1811 [2025-02-08 00:14:35,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:14:35,987 INFO L435 NwaCegarLoop]: 1217 mSDtfsCounter, 1081 mSDsluCounter, 4744 mSDsCounter, 0 mSdLazyCounter, 1800 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 5961 SdHoareTripleChecker+Invalid, 1801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 00:14:35,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1081 Valid, 5961 Invalid, 1801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1800 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 00:14:35,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2025-02-08 00:14:35,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1236. [2025-02-08 00:14:36,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1236 states, 1235 states have (on average 1.4963562753036437) internal successors, (1848), 1235 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:36,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1848 transitions. [2025-02-08 00:14:36,002 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1848 transitions. Word has length 162 [2025-02-08 00:14:36,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:14:36,002 INFO L471 AbstractCegarLoop]: Abstraction has 1236 states and 1848 transitions. [2025-02-08 00:14:36,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 5 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:36,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1848 transitions. [2025-02-08 00:14:36,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-08 00:14:36,003 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:14:36,003 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:14:36,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 00:14:36,003 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:14:36,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:14:36,004 INFO L85 PathProgramCache]: Analyzing trace with hash -460645945, now seen corresponding path program 1 times [2025-02-08 00:14:36,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:14:36,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003160817] [2025-02-08 00:14:36,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:36,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:14:36,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-08 00:14:37,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-08 00:14:37,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:37,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:38,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:14:38,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:14:38,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003160817] [2025-02-08 00:14:38,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003160817] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:14:38,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:14:38,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:14:38,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980044004] [2025-02-08 00:14:38,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:14:38,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:14:38,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:14:38,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:14:38,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:14:38,501 INFO L87 Difference]: Start difference. First operand 1236 states and 1848 transitions. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:39,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:14:39,422 INFO L93 Difference]: Finished difference Result 2865 states and 4285 transitions. [2025-02-08 00:14:39,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:14:39,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2025-02-08 00:14:39,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:14:39,427 INFO L225 Difference]: With dead ends: 2865 [2025-02-08 00:14:39,427 INFO L226 Difference]: Without dead ends: 1801 [2025-02-08 00:14:39,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:14:39,428 INFO L435 NwaCegarLoop]: 1165 mSDtfsCounter, 1102 mSDsluCounter, 3457 mSDsCounter, 0 mSdLazyCounter, 1541 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1102 SdHoareTripleChecker+Valid, 4622 SdHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 00:14:39,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1102 Valid, 4622 Invalid, 1541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1541 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 00:14:39,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states. [2025-02-08 00:14:39,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1236. [2025-02-08 00:14:39,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1236 states, 1235 states have (on average 1.4955465587044534) internal successors, (1847), 1235 states have internal predecessors, (1847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:39,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1847 transitions. [2025-02-08 00:14:39,444 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1847 transitions. Word has length 163 [2025-02-08 00:14:39,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:14:39,444 INFO L471 AbstractCegarLoop]: Abstraction has 1236 states and 1847 transitions. [2025-02-08 00:14:39,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:39,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1847 transitions. [2025-02-08 00:14:39,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-08 00:14:39,446 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:14:39,446 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:14:39,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 00:14:39,446 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:14:39,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:14:39,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1242107046, now seen corresponding path program 1 times [2025-02-08 00:14:39,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:14:39,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417975046] [2025-02-08 00:14:39,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:39,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:14:39,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-08 00:14:41,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-08 00:14:41,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:41,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:42,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:14:42,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:14:42,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417975046] [2025-02-08 00:14:42,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417975046] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:14:42,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:14:42,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:14:42,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856086730] [2025-02-08 00:14:42,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:14:42,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:14:42,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:14:42,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:14:42,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:14:42,210 INFO L87 Difference]: Start difference. First operand 1236 states and 1847 transitions. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:43,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:14:43,154 INFO L93 Difference]: Finished difference Result 2953 states and 4418 transitions. [2025-02-08 00:14:43,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:14:43,155 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 164 [2025-02-08 00:14:43,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:14:43,159 INFO L225 Difference]: With dead ends: 2953 [2025-02-08 00:14:43,159 INFO L226 Difference]: Without dead ends: 1953 [2025-02-08 00:14:43,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:14:43,161 INFO L435 NwaCegarLoop]: 1166 mSDtfsCounter, 1293 mSDsluCounter, 3457 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1293 SdHoareTripleChecker+Valid, 4623 SdHoareTripleChecker+Invalid, 1540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 00:14:43,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1293 Valid, 4623 Invalid, 1540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 00:14:43,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2025-02-08 00:14:43,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1237. [2025-02-08 00:14:43,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1236 states have (on average 1.4951456310679612) internal successors, (1848), 1236 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:43,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1848 transitions. [2025-02-08 00:14:43,174 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1848 transitions. Word has length 164 [2025-02-08 00:14:43,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:14:43,174 INFO L471 AbstractCegarLoop]: Abstraction has 1237 states and 1848 transitions. [2025-02-08 00:14:43,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:43,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1848 transitions. [2025-02-08 00:14:43,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-08 00:14:43,176 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:14:43,176 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:14:43,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 00:14:43,176 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:14:43,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:14:43,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1381158913, now seen corresponding path program 1 times [2025-02-08 00:14:43,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:14:43,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247873201] [2025-02-08 00:14:43,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:43,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:14:43,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-08 00:14:44,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-08 00:14:44,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:44,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:45,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:14:45,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:14:45,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247873201] [2025-02-08 00:14:45,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247873201] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:14:45,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:14:45,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:14:45,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066447417] [2025-02-08 00:14:45,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:14:45,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:14:45,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:14:45,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:14:45,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:14:45,403 INFO L87 Difference]: Start difference. First operand 1237 states and 1848 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:46,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:14:46,397 INFO L93 Difference]: Finished difference Result 2731 states and 4078 transitions. [2025-02-08 00:14:46,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:14:46,398 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2025-02-08 00:14:46,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:14:46,402 INFO L225 Difference]: With dead ends: 2731 [2025-02-08 00:14:46,402 INFO L226 Difference]: Without dead ends: 1579 [2025-02-08 00:14:46,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:14:46,403 INFO L435 NwaCegarLoop]: 1224 mSDtfsCounter, 809 mSDsluCounter, 4757 mSDsCounter, 0 mSdLazyCounter, 1780 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 5981 SdHoareTripleChecker+Invalid, 1781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 00:14:46,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 5981 Invalid, 1781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1780 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 00:14:46,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2025-02-08 00:14:46,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1237. [2025-02-08 00:14:46,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1236 states have (on average 1.494336569579288) internal successors, (1847), 1236 states have internal predecessors, (1847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:46,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1847 transitions. [2025-02-08 00:14:46,415 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1847 transitions. Word has length 165 [2025-02-08 00:14:46,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:14:46,415 INFO L471 AbstractCegarLoop]: Abstraction has 1237 states and 1847 transitions. [2025-02-08 00:14:46,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 5 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:46,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1847 transitions. [2025-02-08 00:14:46,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-08 00:14:46,417 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:14:46,417 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:14:46,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 00:14:46,417 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:14:46,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:14:46,417 INFO L85 PathProgramCache]: Analyzing trace with hash 734431145, now seen corresponding path program 1 times [2025-02-08 00:14:46,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:14:46,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473439453] [2025-02-08 00:14:46,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:46,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:14:46,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-08 00:14:47,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-08 00:14:47,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:47,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:48,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-02-08 00:14:48,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:14:48,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473439453] [2025-02-08 00:14:48,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473439453] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:14:48,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:14:48,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:14:48,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119793402] [2025-02-08 00:14:48,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:14:48,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:14:48,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:14:48,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:14:48,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:14:48,802 INFO L87 Difference]: Start difference. First operand 1237 states and 1847 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:49,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:14:49,623 INFO L93 Difference]: Finished difference Result 2721 states and 4063 transitions. [2025-02-08 00:14:49,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:14:49,624 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 166 [2025-02-08 00:14:49,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:14:49,627 INFO L225 Difference]: With dead ends: 2721 [2025-02-08 00:14:49,628 INFO L226 Difference]: Without dead ends: 1569 [2025-02-08 00:14:49,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:14:49,629 INFO L435 NwaCegarLoop]: 1172 mSDtfsCounter, 795 mSDsluCounter, 3461 mSDsCounter, 0 mSdLazyCounter, 1530 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 4633 SdHoareTripleChecker+Invalid, 1530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 00:14:49,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 4633 Invalid, 1530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1530 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 00:14:49,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2025-02-08 00:14:49,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1237. [2025-02-08 00:14:49,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1236 states have (on average 1.493527508090615) internal successors, (1846), 1236 states have internal predecessors, (1846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:49,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1846 transitions. [2025-02-08 00:14:49,641 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1846 transitions. Word has length 166 [2025-02-08 00:14:49,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:14:49,642 INFO L471 AbstractCegarLoop]: Abstraction has 1237 states and 1846 transitions. [2025-02-08 00:14:49,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:49,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1846 transitions. [2025-02-08 00:14:49,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-08 00:14:49,643 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:14:49,643 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:14:49,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 00:14:49,643 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:14:49,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:14:49,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1530901725, now seen corresponding path program 1 times [2025-02-08 00:14:49,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:14:49,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307786029] [2025-02-08 00:14:49,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:49,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:14:49,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-08 00:14:51,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-08 00:14:51,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:51,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:52,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:14:52,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:14:52,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307786029] [2025-02-08 00:14:52,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307786029] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:14:52,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:14:52,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:14:52,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289606578] [2025-02-08 00:14:52,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:14:52,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:14:52,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:14:52,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:14:52,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:14:52,446 INFO L87 Difference]: Start difference. First operand 1237 states and 1846 transitions. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 5 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:53,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:14:53,406 INFO L93 Difference]: Finished difference Result 2743 states and 4092 transitions. [2025-02-08 00:14:53,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:14:53,407 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 5 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2025-02-08 00:14:53,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:14:53,410 INFO L225 Difference]: With dead ends: 2743 [2025-02-08 00:14:53,411 INFO L226 Difference]: Without dead ends: 1579 [2025-02-08 00:14:53,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:14:53,413 INFO L435 NwaCegarLoop]: 1226 mSDtfsCounter, 813 mSDsluCounter, 4759 mSDsCounter, 0 mSdLazyCounter, 1776 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 5985 SdHoareTripleChecker+Invalid, 1777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 00:14:53,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 5985 Invalid, 1777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1776 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 00:14:53,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2025-02-08 00:14:53,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1237. [2025-02-08 00:14:53,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1236 states have (on average 1.4927184466019416) internal successors, (1845), 1236 states have internal predecessors, (1845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:53,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1845 transitions. [2025-02-08 00:14:53,444 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1845 transitions. Word has length 167 [2025-02-08 00:14:53,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:14:53,444 INFO L471 AbstractCegarLoop]: Abstraction has 1237 states and 1845 transitions. [2025-02-08 00:14:53,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 5 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:53,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1845 transitions. [2025-02-08 00:14:53,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-08 00:14:53,449 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:14:53,450 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:14:53,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 00:14:53,450 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:14:53,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:14:53,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1225467980, now seen corresponding path program 1 times [2025-02-08 00:14:53,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:14:53,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106430090] [2025-02-08 00:14:53,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:53,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:14:53,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-08 00:14:54,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-08 00:14:54,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:54,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:55,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-02-08 00:14:55,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:14:55,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106430090] [2025-02-08 00:14:55,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106430090] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:14:55,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:14:55,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:14:55,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987513404] [2025-02-08 00:14:55,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:14:55,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:14:55,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:14:55,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:14:55,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:14:55,772 INFO L87 Difference]: Start difference. First operand 1237 states and 1845 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:56,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:14:56,690 INFO L93 Difference]: Finished difference Result 2733 states and 4077 transitions. [2025-02-08 00:14:56,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:14:56,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 168 [2025-02-08 00:14:56,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:14:56,694 INFO L225 Difference]: With dead ends: 2733 [2025-02-08 00:14:56,694 INFO L226 Difference]: Without dead ends: 1569 [2025-02-08 00:14:56,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:14:56,696 INFO L435 NwaCegarLoop]: 1174 mSDtfsCounter, 799 mSDsluCounter, 3461 mSDsCounter, 0 mSdLazyCounter, 1528 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 4635 SdHoareTripleChecker+Invalid, 1528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 00:14:56,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 4635 Invalid, 1528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1528 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 00:14:56,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2025-02-08 00:14:56,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1237. [2025-02-08 00:14:56,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1236 states have (on average 1.4919093851132685) internal successors, (1844), 1236 states have internal predecessors, (1844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:56,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1844 transitions. [2025-02-08 00:14:56,707 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1844 transitions. Word has length 168 [2025-02-08 00:14:56,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:14:56,708 INFO L471 AbstractCegarLoop]: Abstraction has 1237 states and 1844 transitions. [2025-02-08 00:14:56,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:56,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1844 transitions. [2025-02-08 00:14:56,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-08 00:14:56,709 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:14:56,709 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:14:56,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 00:14:56,709 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:14:56,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:14:56,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1602752959, now seen corresponding path program 1 times [2025-02-08 00:14:56,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:14:56,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32304215] [2025-02-08 00:14:56,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:56,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:14:56,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-08 00:14:58,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-08 00:14:58,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:58,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:59,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:14:59,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:14:59,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32304215] [2025-02-08 00:14:59,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32304215] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:14:59,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:14:59,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:14:59,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953907579] [2025-02-08 00:14:59,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:14:59,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:14:59,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:14:59,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:14:59,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:14:59,472 INFO L87 Difference]: Start difference. First operand 1237 states and 1844 transitions. Second operand has 5 states, 5 states have (on average 33.8) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:00,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:00,103 INFO L93 Difference]: Finished difference Result 2421 states and 3610 transitions. [2025-02-08 00:15:00,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:15:00,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 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 169 [2025-02-08 00:15:00,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:00,106 INFO L225 Difference]: With dead ends: 2421 [2025-02-08 00:15:00,108 INFO L226 Difference]: Without dead ends: 1245 [2025-02-08 00:15:00,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:15:00,110 INFO L435 NwaCegarLoop]: 1169 mSDtfsCounter, 1534 mSDsluCounter, 2334 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 3503 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:00,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1534 Valid, 3503 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 00:15:00,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2025-02-08 00:15:00,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 1241. [2025-02-08 00:15:00,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1241 states, 1240 states have (on average 1.4903225806451612) internal successors, (1848), 1240 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:00,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1848 transitions. [2025-02-08 00:15:00,128 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1848 transitions. Word has length 169 [2025-02-08 00:15:00,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:00,128 INFO L471 AbstractCegarLoop]: Abstraction has 1241 states and 1848 transitions. [2025-02-08 00:15:00,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:00,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1848 transitions. [2025-02-08 00:15:00,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-02-08 00:15:00,129 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:00,129 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:00,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 00:15:00,129 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:00,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:00,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1053543815, now seen corresponding path program 1 times [2025-02-08 00:15:00,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:00,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831426479] [2025-02-08 00:15:00,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:00,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:00,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-08 00:15:02,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-08 00:15:02,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:02,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:03,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:03,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:03,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831426479] [2025-02-08 00:15:03,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831426479] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:03,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:03,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:15:03,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220584077] [2025-02-08 00:15:03,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:03,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:15:03,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:03,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:15:03,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:15:03,300 INFO L87 Difference]: Start difference. First operand 1241 states and 1848 transitions. Second operand has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:04,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:04,348 INFO L93 Difference]: Finished difference Result 2921 states and 4360 transitions. [2025-02-08 00:15:04,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:15:04,348 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2025-02-08 00:15:04,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:04,352 INFO L225 Difference]: With dead ends: 2921 [2025-02-08 00:15:04,353 INFO L226 Difference]: Without dead ends: 1887 [2025-02-08 00:15:04,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:15:04,354 INFO L435 NwaCegarLoop]: 1224 mSDtfsCounter, 1192 mSDsluCounter, 4757 mSDsCounter, 0 mSdLazyCounter, 1780 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1192 SdHoareTripleChecker+Valid, 5981 SdHoareTripleChecker+Invalid, 1781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:04,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1192 Valid, 5981 Invalid, 1781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1780 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 00:15:04,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1887 states. [2025-02-08 00:15:04,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1887 to 1241. [2025-02-08 00:15:04,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1241 states, 1240 states have (on average 1.489516129032258) internal successors, (1847), 1240 states have internal predecessors, (1847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:04,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1847 transitions. [2025-02-08 00:15:04,365 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1847 transitions. Word has length 170 [2025-02-08 00:15:04,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:04,366 INFO L471 AbstractCegarLoop]: Abstraction has 1241 states and 1847 transitions. [2025-02-08 00:15:04,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:04,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1847 transitions. [2025-02-08 00:15:04,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-08 00:15:04,367 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:04,367 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:04,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 00:15:04,367 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:04,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:04,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1483593808, now seen corresponding path program 1 times [2025-02-08 00:15:04,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:04,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566449580] [2025-02-08 00:15:04,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:04,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:04,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-08 00:15:05,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-08 00:15:05,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:05,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:06,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:06,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:06,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566449580] [2025-02-08 00:15:06,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566449580] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:06,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:06,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:15:06,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985113205] [2025-02-08 00:15:06,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:06,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:15:06,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:06,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:15:06,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:06,565 INFO L87 Difference]: Start difference. First operand 1241 states and 1847 transitions. Second operand has 5 states, 5 states have (on average 34.2) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:07,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:07,522 INFO L93 Difference]: Finished difference Result 2911 states and 4345 transitions. [2025-02-08 00:15:07,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:15:07,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2025-02-08 00:15:07,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:07,526 INFO L225 Difference]: With dead ends: 2911 [2025-02-08 00:15:07,526 INFO L226 Difference]: Without dead ends: 1877 [2025-02-08 00:15:07,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:15:07,527 INFO L435 NwaCegarLoop]: 1172 mSDtfsCounter, 1178 mSDsluCounter, 3457 mSDsCounter, 0 mSdLazyCounter, 1534 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1178 SdHoareTripleChecker+Valid, 4629 SdHoareTripleChecker+Invalid, 1534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:07,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1178 Valid, 4629 Invalid, 1534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1534 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 00:15:07,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2025-02-08 00:15:07,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1241. [2025-02-08 00:15:07,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1241 states, 1240 states have (on average 1.488709677419355) internal successors, (1846), 1240 states have internal predecessors, (1846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:07,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1846 transitions. [2025-02-08 00:15:07,538 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1846 transitions. Word has length 171 [2025-02-08 00:15:07,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:07,538 INFO L471 AbstractCegarLoop]: Abstraction has 1241 states and 1846 transitions. [2025-02-08 00:15:07,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:07,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1846 transitions. [2025-02-08 00:15:07,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-02-08 00:15:07,539 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:07,539 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:07,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 00:15:07,539 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:07,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:07,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1211090895, now seen corresponding path program 1 times [2025-02-08 00:15:07,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:07,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224070995] [2025-02-08 00:15:07,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:07,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:07,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-08 00:15:09,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-08 00:15:09,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:09,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:09,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:09,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:09,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224070995] [2025-02-08 00:15:09,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224070995] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:09,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:09,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:15:09,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547345921] [2025-02-08 00:15:09,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:09,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:15:09,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:09,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:15:09,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:09,969 INFO L87 Difference]: Start difference. First operand 1241 states and 1846 transitions. Second operand has 5 states, 5 states have (on average 34.4) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:10,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:10,541 INFO L93 Difference]: Finished difference Result 2423 states and 3606 transitions. [2025-02-08 00:15:10,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:15:10,541 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 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 172 [2025-02-08 00:15:10,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:10,546 INFO L225 Difference]: With dead ends: 2423 [2025-02-08 00:15:10,546 INFO L226 Difference]: Without dead ends: 1245 [2025-02-08 00:15:10,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:15:10,547 INFO L435 NwaCegarLoop]: 1170 mSDtfsCounter, 1532 mSDsluCounter, 2335 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1532 SdHoareTripleChecker+Valid, 3505 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:10,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1532 Valid, 3505 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1162 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:15:10,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2025-02-08 00:15:10,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 1243. [2025-02-08 00:15:10,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1243 states, 1242 states have (on average 1.4879227053140096) internal successors, (1848), 1242 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:10,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1848 transitions. [2025-02-08 00:15:10,558 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 1848 transitions. Word has length 172 [2025-02-08 00:15:10,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:10,558 INFO L471 AbstractCegarLoop]: Abstraction has 1243 states and 1848 transitions. [2025-02-08 00:15:10,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:10,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1848 transitions. [2025-02-08 00:15:10,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-02-08 00:15:10,561 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:10,561 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:10,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 00:15:10,562 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:10,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:10,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1880306678, now seen corresponding path program 1 times [2025-02-08 00:15:10,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:10,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346369670] [2025-02-08 00:15:10,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:10,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:10,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-08 00:15:12,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-08 00:15:12,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:12,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:14,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:14,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:14,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346369670] [2025-02-08 00:15:14,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346369670] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:14,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:14,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:15:14,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120974491] [2025-02-08 00:15:14,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:14,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:15:14,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:14,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:15:14,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:15:14,470 INFO L87 Difference]: Start difference. First operand 1243 states and 1848 transitions. Second operand has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:15,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:15,294 INFO L93 Difference]: Finished difference Result 2701 states and 4015 transitions. [2025-02-08 00:15:15,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:15:15,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 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 172 [2025-02-08 00:15:15,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:15,296 INFO L225 Difference]: With dead ends: 2701 [2025-02-08 00:15:15,297 INFO L226 Difference]: Without dead ends: 1503 [2025-02-08 00:15:15,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:15:15,298 INFO L435 NwaCegarLoop]: 1269 mSDtfsCounter, 726 mSDsluCounter, 4916 mSDsCounter, 0 mSdLazyCounter, 1534 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 6185 SdHoareTripleChecker+Invalid, 1534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:15,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 6185 Invalid, 1534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1534 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 00:15:15,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2025-02-08 00:15:15,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1243. [2025-02-08 00:15:15,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1243 states, 1242 states have (on average 1.4871175523349436) internal successors, (1847), 1242 states have internal predecessors, (1847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:15,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1847 transitions. [2025-02-08 00:15:15,315 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 1847 transitions. Word has length 172 [2025-02-08 00:15:15,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:15,315 INFO L471 AbstractCegarLoop]: Abstraction has 1243 states and 1847 transitions. [2025-02-08 00:15:15,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:15,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1847 transitions. [2025-02-08 00:15:15,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-08 00:15:15,316 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:15,316 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:15,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 00:15:15,316 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:15,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:15,317 INFO L85 PathProgramCache]: Analyzing trace with hash 817384346, now seen corresponding path program 1 times [2025-02-08 00:15:15,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:15,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748105073] [2025-02-08 00:15:15,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:15,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:15,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-08 00:15:16,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-08 00:15:16,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:16,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:18,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:18,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:18,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748105073] [2025-02-08 00:15:18,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748105073] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:18,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:18,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:15:18,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514740328] [2025-02-08 00:15:18,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:18,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:15:18,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:18,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:15:18,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:15:18,008 INFO L87 Difference]: Start difference. First operand 1243 states and 1847 transitions. Second operand has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 5 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:18,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:18,867 INFO L93 Difference]: Finished difference Result 2816 states and 4194 transitions. [2025-02-08 00:15:18,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:15:18,868 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 5 states have internal predecessors, (173), 0 states have call successors, (0), 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 173 [2025-02-08 00:15:18,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:18,871 INFO L225 Difference]: With dead ends: 2816 [2025-02-08 00:15:18,871 INFO L226 Difference]: Without dead ends: 1727 [2025-02-08 00:15:18,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:15:18,873 INFO L435 NwaCegarLoop]: 1217 mSDtfsCounter, 978 mSDsluCounter, 4740 mSDsCounter, 0 mSdLazyCounter, 1762 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 5957 SdHoareTripleChecker+Invalid, 1762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:18,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 5957 Invalid, 1762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1762 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 00:15:18,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2025-02-08 00:15:18,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1243. [2025-02-08 00:15:18,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1243 states, 1242 states have (on average 1.4863123993558776) internal successors, (1846), 1242 states have internal predecessors, (1846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:18,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1846 transitions. [2025-02-08 00:15:18,883 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 1846 transitions. Word has length 173 [2025-02-08 00:15:18,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:18,883 INFO L471 AbstractCegarLoop]: Abstraction has 1243 states and 1846 transitions. [2025-02-08 00:15:18,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 5 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:18,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1846 transitions. [2025-02-08 00:15:18,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-02-08 00:15:18,884 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:18,884 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:18,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 00:15:18,885 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:18,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:18,885 INFO L85 PathProgramCache]: Analyzing trace with hash -637960306, now seen corresponding path program 1 times [2025-02-08 00:15:18,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:18,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404114983] [2025-02-08 00:15:18,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:18,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:18,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-08 00:15:20,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-08 00:15:20,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:20,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat