./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-551b009-m [2025-01-09 08:20:35,359 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:20:35,416 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 08:20:35,420 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:20:35,423 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:20:35,442 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:20:35,442 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:20:35,442 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:20:35,443 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:20:35,443 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:20:35,443 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:20:35,443 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:20:35,443 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:20:35,443 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:20:35,443 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:20:35,443 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:20:35,443 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:20:35,443 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 08:20:35,443 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:20:35,443 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:20:35,443 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:20:35,443 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:20:35,444 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:20:35,444 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:20:35,444 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:20:35,444 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:20:35,444 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:20:35,444 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:20:35,444 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:20:35,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:20:35,444 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:20:35,444 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:20:35,444 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:20:35,444 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:20:35,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:20:35,444 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:20:35,444 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:20:35,446 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:20:35,446 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:20:35,446 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 08:20:35,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 08:20:35,446 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:20:35,446 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:20:35,446 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:20:35,446 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:20:35,446 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-01-09 08:20:35,715 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:20:35,724 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:20:35,726 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:20:35,727 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:20:35,727 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:20:35,729 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-01-09 08:20:36,944 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/05aa21e0d/c24d87de25d048aaab71ef969f2220ac/FLAGc0c8f13a9 [2025-01-09 08:20:37,219 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:20:37,220 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_two_p2.c [2025-01-09 08:20:37,239 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/05aa21e0d/c24d87de25d048aaab71ef969f2220ac/FLAGc0c8f13a9 [2025-01-09 08:20:37,253 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/05aa21e0d/c24d87de25d048aaab71ef969f2220ac [2025-01-09 08:20:37,255 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:20:37,256 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:20:37,257 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:20:37,257 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:20:37,260 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:20:37,260 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:20:37" (1/1) ... [2025-01-09 08:20:37,261 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5392ec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:37, skipping insertion in model container [2025-01-09 08:20:37,261 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:20:37" (1/1) ... [2025-01-09 08:20:37,303 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:20:37,440 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-01-09 08:20:37,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:20:37,685 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:20:37,692 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-01-09 08:20:37,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:20:37,821 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:20:37,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:37 WrapperNode [2025-01-09 08:20:37,823 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:20:37,824 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:20:37,824 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:20:37,824 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:20:37,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:37" (1/1) ... [2025-01-09 08:20:37,865 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:37" (1/1) ... [2025-01-09 08:20:38,209 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3696 [2025-01-09 08:20:38,210 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:20:38,210 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:20:38,210 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:20:38,210 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:20:38,217 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:37" (1/1) ... [2025-01-09 08:20:38,218 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:37" (1/1) ... [2025-01-09 08:20:38,271 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:37" (1/1) ... [2025-01-09 08:20:38,373 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 08:20:38,374 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:37" (1/1) ... [2025-01-09 08:20:38,374 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:37" (1/1) ... [2025-01-09 08:20:38,450 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:37" (1/1) ... [2025-01-09 08:20:38,461 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:37" (1/1) ... [2025-01-09 08:20:38,481 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:37" (1/1) ... [2025-01-09 08:20:38,509 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:37" (1/1) ... [2025-01-09 08:20:38,530 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:37" (1/1) ... [2025-01-09 08:20:38,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:20:38,586 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:20:38,587 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:20:38,587 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:20:38,588 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:37" (1/1) ... [2025-01-09 08:20:38,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:20:38,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:20:38,615 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 08:20:38,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 08:20:38,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:20:38,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 08:20:38,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:20:38,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:20:38,927 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:20:38,929 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:20:41,579 INFO L? ?]: Removed 2341 outVars from TransFormulas that were not future-live. [2025-01-09 08:20:41,580 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:20:41,613 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:20:41,614 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:20:41,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:20:41 BoogieIcfgContainer [2025-01-09 08:20:41,615 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:20:41,616 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:20:41,617 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:20:41,620 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:20:41,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:20:37" (1/3) ... [2025-01-09 08:20:41,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6082b85f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:20:41, skipping insertion in model container [2025-01-09 08:20:41,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:37" (2/3) ... [2025-01-09 08:20:41,623 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6082b85f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:20:41, skipping insertion in model container [2025-01-09 08:20:41,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:20:41" (3/3) ... [2025-01-09 08:20:41,624 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_two_p2.c [2025-01-09 08:20:41,675 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:20:41,676 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_two_p2.c that has 1 procedures, 1041 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:20:41,742 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:20:41,749 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;@1f39c1de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:20:41,750 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:20:41,755 INFO L276 IsEmpty]: Start isEmpty. Operand has 1041 states, 1039 states have (on average 1.5024061597690086) internal successors, (1561), 1040 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:41,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 08:20:41,765 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:41,766 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:41,766 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:41,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:41,772 INFO L85 PathProgramCache]: Analyzing trace with hash -374697008, now seen corresponding path program 1 times [2025-01-09 08:20:41,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:41,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900566278] [2025-01-09 08:20:41,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:41,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:41,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 08:20:42,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 08:20:42,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:42,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:43,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:43,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:43,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900566278] [2025-01-09 08:20:43,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900566278] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:43,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:43,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:20:43,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276272219] [2025-01-09 08:20:43,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:43,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:20:43,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:43,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:20:43,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:20:43,654 INFO L87 Difference]: Start difference. First operand has 1041 states, 1039 states have (on average 1.5024061597690086) internal successors, (1561), 1040 states have internal predecessors, (1561), 0 states have call successors, (0), 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.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:43,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:43,793 INFO L93 Difference]: Finished difference Result 2039 states and 3061 transitions. [2025-01-09 08:20:43,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:20:43,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2025-01-09 08:20:43,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:43,808 INFO L225 Difference]: With dead ends: 2039 [2025-01-09 08:20:43,809 INFO L226 Difference]: Without dead ends: 1040 [2025-01-09 08:20:43,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:20:43,815 INFO L435 NwaCegarLoop]: 1555 mSDtfsCounter, 0 mSDsluCounter, 3104 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4659 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:43,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4659 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:43,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2025-01-09 08:20:43,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1040. [2025-01-09 08:20:43,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1040 states, 1039 states have (on average 1.5004812319538017) internal successors, (1559), 1039 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-01-09 08:20:43,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1559 transitions. [2025-01-09 08:20:43,877 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1559 transitions. Word has length 155 [2025-01-09 08:20:43,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:43,878 INFO L471 AbstractCegarLoop]: Abstraction has 1040 states and 1559 transitions. [2025-01-09 08:20:43,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:43,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1559 transitions. [2025-01-09 08:20:43,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 08:20:43,881 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:43,881 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:43,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 08:20:43,882 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:43,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:43,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1270990803, now seen corresponding path program 1 times [2025-01-09 08:20:43,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:43,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530709121] [2025-01-09 08:20:43,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:43,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:43,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 08:20:44,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 08:20:44,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:44,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:44,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:44,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:44,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530709121] [2025-01-09 08:20:44,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530709121] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:44,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:44,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:20:44,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304180125] [2025-01-09 08:20:44,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:44,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:20:44,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:44,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:20:44,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:20:44,626 INFO L87 Difference]: Start difference. First operand 1040 states and 1559 transitions. Second operand has 4 states, 4 states have (on average 39.0) 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-01-09 08:20:44,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:44,677 INFO L93 Difference]: Finished difference Result 2040 states and 3059 transitions. [2025-01-09 08:20:44,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:20:44,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) 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-01-09 08:20:44,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:44,681 INFO L225 Difference]: With dead ends: 2040 [2025-01-09 08:20:44,681 INFO L226 Difference]: Without dead ends: 1042 [2025-01-09 08:20:44,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:20:44,683 INFO L435 NwaCegarLoop]: 1555 mSDtfsCounter, 0 mSDsluCounter, 3100 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4655 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:44,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4655 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:44,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2025-01-09 08:20:44,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1042. [2025-01-09 08:20:44,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 1041 states have (on average 1.4995196926032661) internal successors, (1561), 1041 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:44,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1561 transitions. [2025-01-09 08:20:44,715 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1561 transitions. Word has length 156 [2025-01-09 08:20:44,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:44,716 INFO L471 AbstractCegarLoop]: Abstraction has 1042 states and 1561 transitions. [2025-01-09 08:20:44,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) 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-01-09 08:20:44,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1561 transitions. [2025-01-09 08:20:44,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 08:20:44,717 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:44,718 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:44,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 08:20:44,718 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:44,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:44,718 INFO L85 PathProgramCache]: Analyzing trace with hash -351955703, now seen corresponding path program 1 times [2025-01-09 08:20:44,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:44,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520005168] [2025-01-09 08:20:44,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:44,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:44,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 08:20:47,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 08:20:47,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:47,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:49,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:49,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:49,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520005168] [2025-01-09 08:20:49,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520005168] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:49,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:49,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:20:49,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286024954] [2025-01-09 08:20:49,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:49,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:20:49,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:49,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:20:49,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:49,625 INFO L87 Difference]: Start difference. First operand 1042 states and 1561 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:50,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:50,197 INFO L93 Difference]: Finished difference Result 2802 states and 4199 transitions. [2025-01-09 08:20:50,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:20:50,198 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2025-01-09 08:20:50,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:50,205 INFO L225 Difference]: With dead ends: 2802 [2025-01-09 08:20:50,205 INFO L226 Difference]: Without dead ends: 1802 [2025-01-09 08:20:50,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-01-09 08:20:50,207 INFO L435 NwaCegarLoop]: 1388 mSDtfsCounter, 1107 mSDsluCounter, 4147 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 5535 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:50,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1107 Valid, 5535 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 08:20:50,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2025-01-09 08:20:50,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1183. [2025-01-09 08:20:50,233 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-01-09 08:20:50,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1773 transitions. [2025-01-09 08:20:50,237 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1773 transitions. Word has length 157 [2025-01-09 08:20:50,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:50,238 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1773 transitions. [2025-01-09 08:20:50,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:50,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1773 transitions. [2025-01-09 08:20:50,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-09 08:20:50,240 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:50,240 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-01-09 08:20:50,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 08:20:50,241 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:50,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:50,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1848655630, now seen corresponding path program 1 times [2025-01-09 08:20:50,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:50,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131586089] [2025-01-09 08:20:50,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:50,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:50,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 08:20:51,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 08:20:51,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:51,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:53,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:53,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:53,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131586089] [2025-01-09 08:20:53,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131586089] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:53,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:53,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:20:53,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232120861] [2025-01-09 08:20:53,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:53,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:20:53,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:53,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:20:53,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:53,307 INFO L87 Difference]: Start difference. First operand 1183 states and 1773 transitions. Second operand has 5 states, 5 states have (on average 31.6) 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-01-09 08:20:53,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:53,814 INFO L93 Difference]: Finished difference Result 2802 states and 4198 transitions. [2025-01-09 08:20:53,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:20:53,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) 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-01-09 08:20:53,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:53,821 INFO L225 Difference]: With dead ends: 2802 [2025-01-09 08:20:53,821 INFO L226 Difference]: Without dead ends: 1802 [2025-01-09 08:20:53,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-01-09 08:20:53,827 INFO L435 NwaCegarLoop]: 1389 mSDtfsCounter, 1105 mSDsluCounter, 4147 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1105 SdHoareTripleChecker+Valid, 5536 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:53,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1105 Valid, 5536 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 08:20:53,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2025-01-09 08:20:53,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1184. [2025-01-09 08:20:53,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 1183 states have (on average 1.4995773457311918) internal successors, (1774), 1183 states have internal predecessors, (1774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:53,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1774 transitions. [2025-01-09 08:20:53,857 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1774 transitions. Word has length 158 [2025-01-09 08:20:53,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:53,857 INFO L471 AbstractCegarLoop]: Abstraction has 1184 states and 1774 transitions. [2025-01-09 08:20:53,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) 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-01-09 08:20:53,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1774 transitions. [2025-01-09 08:20:53,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-09 08:20:53,859 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:53,860 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:53,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 08:20:53,860 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:53,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:53,861 INFO L85 PathProgramCache]: Analyzing trace with hash 47819398, now seen corresponding path program 1 times [2025-01-09 08:20:53,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:53,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106144901] [2025-01-09 08:20:53,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:53,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:53,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 08:20:54,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 08:20:54,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:54,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:56,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:56,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:56,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106144901] [2025-01-09 08:20:56,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106144901] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:56,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:56,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:20:56,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194915279] [2025-01-09 08:20:56,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:56,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:20:56,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:56,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:20:56,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:20:56,225 INFO L87 Difference]: Start difference. First operand 1184 states and 1774 transitions. Second operand has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:56,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:56,780 INFO L93 Difference]: Finished difference Result 2995 states and 4487 transitions. [2025-01-09 08:20:56,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:20:56,781 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2025-01-09 08:20:56,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:56,787 INFO L225 Difference]: With dead ends: 2995 [2025-01-09 08:20:56,788 INFO L226 Difference]: Without dead ends: 1995 [2025-01-09 08:20:56,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-01-09 08:20:56,790 INFO L435 NwaCegarLoop]: 1615 mSDtfsCounter, 1365 mSDsluCounter, 6001 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1365 SdHoareTripleChecker+Valid, 7616 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:56,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1365 Valid, 7616 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 08:20:56,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2025-01-09 08:20:56,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1204. [2025-01-09 08:20:56,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 1203 states have (on average 1.4987531172069826) internal successors, (1803), 1203 states have internal predecessors, (1803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:56,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1803 transitions. [2025-01-09 08:20:56,812 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1803 transitions. Word has length 159 [2025-01-09 08:20:56,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:56,812 INFO L471 AbstractCegarLoop]: Abstraction has 1204 states and 1803 transitions. [2025-01-09 08:20:56,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:56,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1803 transitions. [2025-01-09 08:20:56,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 08:20:56,813 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:56,814 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-01-09 08:20:56,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 08:20:56,814 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:56,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:56,814 INFO L85 PathProgramCache]: Analyzing trace with hash -275717235, now seen corresponding path program 1 times [2025-01-09 08:20:56,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:56,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417289680] [2025-01-09 08:20:56,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:56,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:56,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 08:20:58,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 08:20:58,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:58,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:59,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:59,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:59,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417289680] [2025-01-09 08:20:59,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417289680] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:59,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:59,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:20:59,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653391717] [2025-01-09 08:20:59,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:59,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:20:59,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:59,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:20:59,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:20:59,422 INFO L87 Difference]: Start difference. First operand 1204 states and 1803 transitions. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 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-01-09 08:20:59,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:59,795 INFO L93 Difference]: Finished difference Result 2741 states and 4104 transitions. [2025-01-09 08:20:59,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:20:59,795 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 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-01-09 08:20:59,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:59,800 INFO L225 Difference]: With dead ends: 2741 [2025-01-09 08:20:59,800 INFO L226 Difference]: Without dead ends: 1498 [2025-01-09 08:20:59,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-01-09 08:20:59,802 INFO L435 NwaCegarLoop]: 1516 mSDtfsCounter, 3299 mSDsluCounter, 4433 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3299 SdHoareTripleChecker+Valid, 5949 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:59,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3299 Valid, 5949 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 08:20:59,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2025-01-09 08:20:59,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1204. [2025-01-09 08:20:59,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 1203 states have (on average 1.4979218620116377) internal successors, (1802), 1203 states have internal predecessors, (1802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:59,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1802 transitions. [2025-01-09 08:20:59,825 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1802 transitions. Word has length 160 [2025-01-09 08:20:59,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:59,825 INFO L471 AbstractCegarLoop]: Abstraction has 1204 states and 1802 transitions. [2025-01-09 08:20:59,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 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-01-09 08:20:59,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1802 transitions. [2025-01-09 08:20:59,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 08:20:59,827 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:59,827 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:59,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 08:20:59,827 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:59,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:59,828 INFO L85 PathProgramCache]: Analyzing trace with hash -610417796, now seen corresponding path program 1 times [2025-01-09 08:20:59,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:59,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620520528] [2025-01-09 08:20:59,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:59,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:59,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 08:21:01,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 08:21:01,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:01,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:21:02,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:02,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:21:02,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620520528] [2025-01-09 08:21:02,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620520528] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:21:02,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:21:02,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:21:02,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791134163] [2025-01-09 08:21:02,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:21:02,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:21:02,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:21:02,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:21:02,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:21:02,450 INFO L87 Difference]: Start difference. First operand 1204 states and 1802 transitions. Second operand has 5 states, 5 states have (on average 32.2) 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-01-09 08:21:02,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:21:02,935 INFO L93 Difference]: Finished difference Result 2874 states and 4303 transitions. [2025-01-09 08:21:02,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:21:02,935 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) 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-01-09 08:21:02,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:21:02,941 INFO L225 Difference]: With dead ends: 2874 [2025-01-09 08:21:02,941 INFO L226 Difference]: Without dead ends: 1874 [2025-01-09 08:21:02,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-01-09 08:21:02,943 INFO L435 NwaCegarLoop]: 1392 mSDtfsCounter, 1197 mSDsluCounter, 4147 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1197 SdHoareTripleChecker+Valid, 5539 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 08:21:02,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1197 Valid, 5539 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 08:21:02,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2025-01-09 08:21:02,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1205. [2025-01-09 08:21:02,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 1204 states have (on average 1.4975083056478404) internal successors, (1803), 1204 states have internal predecessors, (1803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:02,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1803 transitions. [2025-01-09 08:21:02,966 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1803 transitions. Word has length 161 [2025-01-09 08:21:02,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:21:02,966 INFO L471 AbstractCegarLoop]: Abstraction has 1205 states and 1803 transitions. [2025-01-09 08:21:02,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) 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-01-09 08:21:02,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1803 transitions. [2025-01-09 08:21:02,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 08:21:02,967 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:21:02,968 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:21:02,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 08:21:02,968 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:21:02,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:21:02,968 INFO L85 PathProgramCache]: Analyzing trace with hash 854778356, now seen corresponding path program 1 times [2025-01-09 08:21:02,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:21:02,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415877427] [2025-01-09 08:21:02,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:02,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:21:03,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 08:21:04,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 08:21:04,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:04,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:21:06,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:06,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:21:06,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415877427] [2025-01-09 08:21:06,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415877427] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:21:06,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:21:06,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:21:06,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874130132] [2025-01-09 08:21:06,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:21:06,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:21:06,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:21:06,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:21:06,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:21:06,148 INFO L87 Difference]: Start difference. First operand 1205 states and 1803 transitions. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:06,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:21:06,645 INFO L93 Difference]: Finished difference Result 2711 states and 4055 transitions. [2025-01-09 08:21:06,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:21:06,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 162 [2025-01-09 08:21:06,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:21:06,650 INFO L225 Difference]: With dead ends: 2711 [2025-01-09 08:21:06,651 INFO L226 Difference]: Without dead ends: 1580 [2025-01-09 08:21:06,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-01-09 08:21:06,653 INFO L435 NwaCegarLoop]: 1462 mSDtfsCounter, 819 mSDsluCounter, 5704 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 7166 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 08:21:06,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 7166 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 08:21:06,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2025-01-09 08:21:06,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1205. [2025-01-09 08:21:06,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 1204 states have (on average 1.4966777408637875) internal successors, (1802), 1204 states have internal predecessors, (1802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:06,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1802 transitions. [2025-01-09 08:21:06,675 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1802 transitions. Word has length 162 [2025-01-09 08:21:06,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:21:06,675 INFO L471 AbstractCegarLoop]: Abstraction has 1205 states and 1802 transitions. [2025-01-09 08:21:06,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:06,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1802 transitions. [2025-01-09 08:21:06,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-01-09 08:21:06,676 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:21:06,676 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-01-09 08:21:06,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 08:21:06,677 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:21:06,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:21:06,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1997244551, now seen corresponding path program 1 times [2025-01-09 08:21:06,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:21:06,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708470362] [2025-01-09 08:21:06,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:06,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:21:06,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 08:21:07,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 08:21:07,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:07,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:21:08,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:08,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:21:08,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708470362] [2025-01-09 08:21:08,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708470362] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:21:08,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:21:08,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:21:08,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045459664] [2025-01-09 08:21:08,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:21:08,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:21:08,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:21:08,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:21:08,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:21:08,427 INFO L87 Difference]: Start difference. First operand 1205 states and 1802 transitions. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 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-01-09 08:21:08,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:21:08,710 INFO L93 Difference]: Finished difference Result 2356 states and 3525 transitions. [2025-01-09 08:21:08,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:21:08,714 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 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-01-09 08:21:08,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:21:08,717 INFO L225 Difference]: With dead ends: 2356 [2025-01-09 08:21:08,717 INFO L226 Difference]: Without dead ends: 1213 [2025-01-09 08:21:08,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-01-09 08:21:08,719 INFO L435 NwaCegarLoop]: 1398 mSDtfsCounter, 1534 mSDsluCounter, 2793 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 4191 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 08:21:08,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1534 Valid, 4191 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 08:21:08,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2025-01-09 08:21:08,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1209. [2025-01-09 08:21:08,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 1208 states have (on average 1.4950331125827814) internal successors, (1806), 1208 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:08,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1806 transitions. [2025-01-09 08:21:08,736 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1806 transitions. Word has length 163 [2025-01-09 08:21:08,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:21:08,736 INFO L471 AbstractCegarLoop]: Abstraction has 1209 states and 1806 transitions. [2025-01-09 08:21:08,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 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-01-09 08:21:08,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1806 transitions. [2025-01-09 08:21:08,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 08:21:08,737 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:21:08,737 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:21:08,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 08:21:08,738 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:21:08,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:21:08,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1437899551, now seen corresponding path program 1 times [2025-01-09 08:21:08,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:21:08,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135097681] [2025-01-09 08:21:08,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:08,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:21:08,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 08:21:09,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 08:21:09,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:09,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:21:11,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:11,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:21:11,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135097681] [2025-01-09 08:21:11,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135097681] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:21:11,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:21:11,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:21:11,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614836560] [2025-01-09 08:21:11,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:21:11,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:21:11,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:21:11,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:21:11,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:21:11,530 INFO L87 Difference]: Start difference. First operand 1209 states and 1806 transitions. Second operand has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:11,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:21:11,991 INFO L93 Difference]: Finished difference Result 2818 states and 4213 transitions. [2025-01-09 08:21:11,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:21:11,992 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 164 [2025-01-09 08:21:11,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:21:11,996 INFO L225 Difference]: With dead ends: 2818 [2025-01-09 08:21:11,996 INFO L226 Difference]: Without dead ends: 1816 [2025-01-09 08:21:11,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-01-09 08:21:11,998 INFO L435 NwaCegarLoop]: 1459 mSDtfsCounter, 1075 mSDsluCounter, 5692 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 7151 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 08:21:11,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 7151 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 08:21:12,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2025-01-09 08:21:12,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1253. [2025-01-09 08:21:12,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 1252 states have (on average 1.494408945686901) internal successors, (1871), 1252 states have internal predecessors, (1871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:12,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1871 transitions. [2025-01-09 08:21:12,016 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 1871 transitions. Word has length 164 [2025-01-09 08:21:12,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:21:12,016 INFO L471 AbstractCegarLoop]: Abstraction has 1253 states and 1871 transitions. [2025-01-09 08:21:12,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:12,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1871 transitions. [2025-01-09 08:21:12,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 08:21:12,017 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:21:12,018 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:21:12,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 08:21:12,018 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:21:12,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:21:12,018 INFO L85 PathProgramCache]: Analyzing trace with hash 2071498850, now seen corresponding path program 1 times [2025-01-09 08:21:12,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:21:12,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002231457] [2025-01-09 08:21:12,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:12,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:21:12,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 08:21:13,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 08:21:13,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:13,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:21:14,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:14,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:21:14,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002231457] [2025-01-09 08:21:14,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002231457] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:21:14,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:21:14,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:21:14,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616177199] [2025-01-09 08:21:14,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:21:14,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:21:14,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:21:14,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:21:14,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:21:14,668 INFO L87 Difference]: Start difference. First operand 1253 states and 1871 transitions. Second operand has 5 states, 5 states have (on average 33.0) 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-01-09 08:21:15,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:21:15,082 INFO L93 Difference]: Finished difference Result 2751 states and 4110 transitions. [2025-01-09 08:21:15,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:21:15,083 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) 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-01-09 08:21:15,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:21:15,086 INFO L225 Difference]: With dead ends: 2751 [2025-01-09 08:21:15,086 INFO L226 Difference]: Without dead ends: 1574 [2025-01-09 08:21:15,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-01-09 08:21:15,088 INFO L435 NwaCegarLoop]: 1399 mSDtfsCounter, 803 mSDsluCounter, 4151 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 5550 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 08:21:15,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 5550 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 08:21:15,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2025-01-09 08:21:15,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1253. [2025-01-09 08:21:15,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 1252 states have (on average 1.4936102236421724) internal successors, (1870), 1252 states have internal predecessors, (1870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:15,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1870 transitions. [2025-01-09 08:21:15,109 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 1870 transitions. Word has length 165 [2025-01-09 08:21:15,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:21:15,109 INFO L471 AbstractCegarLoop]: Abstraction has 1253 states and 1870 transitions. [2025-01-09 08:21:15,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) 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-01-09 08:21:15,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1870 transitions. [2025-01-09 08:21:15,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 08:21:15,110 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:21:15,111 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:21:15,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 08:21:15,111 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:21:15,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:21:15,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1057666024, now seen corresponding path program 1 times [2025-01-09 08:21:15,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:21:15,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684710935] [2025-01-09 08:21:15,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:15,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:21:15,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 08:21:16,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 08:21:16,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:16,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:21:17,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:17,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:21:17,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684710935] [2025-01-09 08:21:17,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684710935] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:21:17,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:21:17,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:21:17,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748297792] [2025-01-09 08:21:17,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:21:17,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:21:17,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:21:17,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:21:17,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:21:17,770 INFO L87 Difference]: Start difference. First operand 1253 states and 1870 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:18,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:21:18,125 INFO L93 Difference]: Finished difference Result 2960 states and 4425 transitions. [2025-01-09 08:21:18,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:21:18,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 166 [2025-01-09 08:21:18,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:21:18,130 INFO L225 Difference]: With dead ends: 2960 [2025-01-09 08:21:18,130 INFO L226 Difference]: Without dead ends: 1958 [2025-01-09 08:21:18,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-01-09 08:21:18,131 INFO L435 NwaCegarLoop]: 1396 mSDtfsCounter, 1286 mSDsluCounter, 4147 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1286 SdHoareTripleChecker+Valid, 5543 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 08:21:18,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1286 Valid, 5543 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 08:21:18,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states. [2025-01-09 08:21:18,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1254. [2025-01-09 08:21:18,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1253 states have (on average 1.493216280925778) internal successors, (1871), 1253 states have internal predecessors, (1871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:18,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1871 transitions. [2025-01-09 08:21:18,145 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1871 transitions. Word has length 166 [2025-01-09 08:21:18,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:21:18,146 INFO L471 AbstractCegarLoop]: Abstraction has 1254 states and 1871 transitions. [2025-01-09 08:21:18,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:18,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1871 transitions. [2025-01-09 08:21:18,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 08:21:18,147 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:21:18,148 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-01-09 08:21:18,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 08:21:18,148 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:21:18,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:21:18,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1950670102, now seen corresponding path program 1 times [2025-01-09 08:21:18,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:21:18,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616461415] [2025-01-09 08:21:18,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:18,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:21:18,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 08:21:20,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 08:21:20,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:20,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:21:20,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:20,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:21:20,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616461415] [2025-01-09 08:21:20,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616461415] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:21:20,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:21:20,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:21:20,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844814203] [2025-01-09 08:21:20,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:21:20,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:21:20,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:21:20,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:21:20,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:21:20,752 INFO L87 Difference]: Start difference. First operand 1254 states and 1871 transitions. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 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-01-09 08:21:21,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:21:21,032 INFO L93 Difference]: Finished difference Result 2448 states and 3655 transitions. [2025-01-09 08:21:21,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:21:21,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 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-01-09 08:21:21,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:21:21,035 INFO L225 Difference]: With dead ends: 2448 [2025-01-09 08:21:21,036 INFO L226 Difference]: Without dead ends: 1262 [2025-01-09 08:21:21,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 08:21:21,037 INFO L435 NwaCegarLoop]: 1451 mSDtfsCounter, 1534 mSDsluCounter, 4349 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 5800 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:21:21,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1534 Valid, 5800 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:21:21,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2025-01-09 08:21:21,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1258. [2025-01-09 08:21:21,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1257 states have (on average 1.4916467780429594) internal successors, (1875), 1257 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:21,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1875 transitions. [2025-01-09 08:21:21,052 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1875 transitions. Word has length 167 [2025-01-09 08:21:21,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:21:21,052 INFO L471 AbstractCegarLoop]: Abstraction has 1258 states and 1875 transitions. [2025-01-09 08:21:21,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 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-01-09 08:21:21,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1875 transitions. [2025-01-09 08:21:21,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 08:21:21,053 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:21:21,053 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-01-09 08:21:21,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 08:21:21,054 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:21:21,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:21:21,054 INFO L85 PathProgramCache]: Analyzing trace with hash -2146320902, now seen corresponding path program 1 times [2025-01-09 08:21:21,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:21:21,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084589146] [2025-01-09 08:21:21,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:21,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:21:21,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 08:21:22,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 08:21:22,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:22,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:21:24,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:24,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:21:24,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084589146] [2025-01-09 08:21:24,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084589146] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:21:24,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:21:24,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:21:24,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447300016] [2025-01-09 08:21:24,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:21:24,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:21:24,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:21:24,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:21:24,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:21:24,120 INFO L87 Difference]: Start difference. First operand 1258 states and 1875 transitions. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 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-01-09 08:21:24,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:21:24,404 INFO L93 Difference]: Finished difference Result 2901 states and 4327 transitions. [2025-01-09 08:21:24,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:21:24,405 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 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-01-09 08:21:24,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:21:24,409 INFO L225 Difference]: With dead ends: 2901 [2025-01-09 08:21:24,409 INFO L226 Difference]: Without dead ends: 1820 [2025-01-09 08:21:24,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-01-09 08:21:24,411 INFO L435 NwaCegarLoop]: 1462 mSDtfsCounter, 2162 mSDsluCounter, 4331 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2162 SdHoareTripleChecker+Valid, 5793 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:21:24,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2162 Valid, 5793 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:21:24,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states. [2025-01-09 08:21:24,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1258. [2025-01-09 08:21:24,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1257 states have (on average 1.49085123309467) internal successors, (1874), 1257 states have internal predecessors, (1874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:24,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1874 transitions. [2025-01-09 08:21:24,425 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1874 transitions. Word has length 167 [2025-01-09 08:21:24,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:21:24,425 INFO L471 AbstractCegarLoop]: Abstraction has 1258 states and 1874 transitions. [2025-01-09 08:21:24,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 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-01-09 08:21:24,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1874 transitions. [2025-01-09 08:21:24,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 08:21:24,426 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:21:24,426 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:21:24,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 08:21:24,427 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:21:24,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:21:24,427 INFO L85 PathProgramCache]: Analyzing trace with hash 462857796, now seen corresponding path program 1 times [2025-01-09 08:21:24,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:21:24,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326143191] [2025-01-09 08:21:24,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:24,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:21:24,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 08:21:25,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 08:21:25,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:25,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:21:26,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:26,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:21:26,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326143191] [2025-01-09 08:21:26,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326143191] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:21:26,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:21:26,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:21:26,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603359530] [2025-01-09 08:21:26,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:21:26,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:21:26,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:21:26,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:21:26,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:21:26,935 INFO L87 Difference]: Start difference. First operand 1258 states and 1874 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:27,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:21:27,306 INFO L93 Difference]: Finished difference Result 2891 states and 4312 transitions. [2025-01-09 08:21:27,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:21:27,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 168 [2025-01-09 08:21:27,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:21:27,314 INFO L225 Difference]: With dead ends: 2891 [2025-01-09 08:21:27,314 INFO L226 Difference]: Without dead ends: 1810 [2025-01-09 08:21:27,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-01-09 08:21:27,316 INFO L435 NwaCegarLoop]: 1398 mSDtfsCounter, 1098 mSDsluCounter, 4147 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 5545 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 08:21:27,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 5545 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 08:21:27,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2025-01-09 08:21:27,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1258. [2025-01-09 08:21:27,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1257 states have (on average 1.4900556881463802) internal successors, (1873), 1257 states have internal predecessors, (1873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:27,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1873 transitions. [2025-01-09 08:21:27,330 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1873 transitions. Word has length 168 [2025-01-09 08:21:27,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:21:27,330 INFO L471 AbstractCegarLoop]: Abstraction has 1258 states and 1873 transitions. [2025-01-09 08:21:27,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:27,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1873 transitions. [2025-01-09 08:21:27,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 08:21:27,332 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:21:27,332 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-01-09 08:21:27,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 08:21:27,332 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:21:27,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:21:27,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1001569303, now seen corresponding path program 1 times [2025-01-09 08:21:27,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:21:27,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646456068] [2025-01-09 08:21:27,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:27,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:21:27,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 08:21:29,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 08:21:29,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:29,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:21:30,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:30,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:21:30,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646456068] [2025-01-09 08:21:30,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646456068] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:21:30,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:21:30,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:21:30,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820988336] [2025-01-09 08:21:30,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:21:30,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:21:30,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:21:30,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:21:30,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:21:30,944 INFO L87 Difference]: Start difference. First operand 1258 states and 1873 transitions. Second operand has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 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-01-09 08:21:31,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:21:31,256 INFO L93 Difference]: Finished difference Result 2987 states and 4457 transitions. [2025-01-09 08:21:31,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:21:31,256 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 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-01-09 08:21:31,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:21:31,261 INFO L225 Difference]: With dead ends: 2987 [2025-01-09 08:21:31,261 INFO L226 Difference]: Without dead ends: 1972 [2025-01-09 08:21:31,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-01-09 08:21:31,263 INFO L435 NwaCegarLoop]: 1464 mSDtfsCounter, 2539 mSDsluCounter, 4330 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2539 SdHoareTripleChecker+Valid, 5794 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 08:21:31,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2539 Valid, 5794 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 08:21:31,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1972 states. [2025-01-09 08:21:31,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1972 to 1258. [2025-01-09 08:21:31,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1257 states have (on average 1.4892601431980907) internal successors, (1872), 1257 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:31,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1872 transitions. [2025-01-09 08:21:31,277 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1872 transitions. Word has length 169 [2025-01-09 08:21:31,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:21:31,277 INFO L471 AbstractCegarLoop]: Abstraction has 1258 states and 1872 transitions. [2025-01-09 08:21:31,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 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-01-09 08:21:31,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1872 transitions. [2025-01-09 08:21:31,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-09 08:21:31,278 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:21:31,278 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-01-09 08:21:31,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 08:21:31,278 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:21:31,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:21:31,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1596963239, now seen corresponding path program 1 times [2025-01-09 08:21:31,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:21:31,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111341059] [2025-01-09 08:21:31,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:31,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:21:31,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 08:21:32,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 08:21:32,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:32,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:21:33,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:33,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:21:33,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111341059] [2025-01-09 08:21:33,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111341059] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:21:33,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:21:33,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:21:33,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867854779] [2025-01-09 08:21:33,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:21:33,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:21:33,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:21:33,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:21:33,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:21:33,702 INFO L87 Difference]: Start difference. First operand 1258 states and 1872 transitions. Second operand has 5 states, 5 states have (on average 34.0) 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-01-09 08:21:34,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:21:34,095 INFO L93 Difference]: Finished difference Result 2977 states and 4442 transitions. [2025-01-09 08:21:34,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:21:34,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.0) 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-01-09 08:21:34,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:21:34,100 INFO L225 Difference]: With dead ends: 2977 [2025-01-09 08:21:34,100 INFO L226 Difference]: Without dead ends: 1962 [2025-01-09 08:21:34,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-01-09 08:21:34,101 INFO L435 NwaCegarLoop]: 1400 mSDtfsCounter, 1286 mSDsluCounter, 4147 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1286 SdHoareTripleChecker+Valid, 5547 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 08:21:34,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1286 Valid, 5547 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 08:21:34,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2025-01-09 08:21:34,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1258. [2025-01-09 08:21:34,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1257 states have (on average 1.488464598249801) internal successors, (1871), 1257 states have internal predecessors, (1871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:34,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1871 transitions. [2025-01-09 08:21:34,116 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1871 transitions. Word has length 170 [2025-01-09 08:21:34,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:21:34,117 INFO L471 AbstractCegarLoop]: Abstraction has 1258 states and 1871 transitions. [2025-01-09 08:21:34,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.0) 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-01-09 08:21:34,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1871 transitions. [2025-01-09 08:21:34,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 08:21:34,118 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:21:34,118 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:21:34,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 08:21:34,118 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:21:34,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:21:34,118 INFO L85 PathProgramCache]: Analyzing trace with hash -174873676, now seen corresponding path program 1 times [2025-01-09 08:21:34,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:21:34,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177028767] [2025-01-09 08:21:34,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:34,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:21:34,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 08:21:35,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 08:21:35,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:35,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:21:36,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:36,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:21:36,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177028767] [2025-01-09 08:21:36,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177028767] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:21:36,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:21:36,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:21:36,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487795454] [2025-01-09 08:21:36,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:21:36,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:21:36,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:21:36,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:21:36,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:21:36,489 INFO L87 Difference]: Start difference. First operand 1258 states and 1871 transitions. Second operand has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:36,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:21:36,837 INFO L93 Difference]: Finished difference Result 2756 states and 4103 transitions. [2025-01-09 08:21:36,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:21:36,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2025-01-09 08:21:36,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:21:36,840 INFO L225 Difference]: With dead ends: 2756 [2025-01-09 08:21:36,840 INFO L226 Difference]: Without dead ends: 1588 [2025-01-09 08:21:36,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-01-09 08:21:36,842 INFO L435 NwaCegarLoop]: 1470 mSDtfsCounter, 802 mSDsluCounter, 5712 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 7182 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 08:21:36,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 7182 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 08:21:36,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1588 states. [2025-01-09 08:21:36,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1588 to 1258. [2025-01-09 08:21:36,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1257 states have (on average 1.4876690533015116) internal successors, (1870), 1257 states have internal predecessors, (1870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:36,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1870 transitions. [2025-01-09 08:21:36,854 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1870 transitions. Word has length 171 [2025-01-09 08:21:36,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:21:36,854 INFO L471 AbstractCegarLoop]: Abstraction has 1258 states and 1870 transitions. [2025-01-09 08:21:36,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:36,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1870 transitions. [2025-01-09 08:21:36,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-01-09 08:21:36,855 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:21:36,855 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-01-09 08:21:36,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 08:21:36,856 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:21:36,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:21:36,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1069152960, now seen corresponding path program 1 times [2025-01-09 08:21:36,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:21:36,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486775269] [2025-01-09 08:21:36,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:36,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:21:36,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 08:21:38,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 08:21:38,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:38,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:21:39,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:39,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:21:39,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486775269] [2025-01-09 08:21:39,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486775269] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:21:39,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:21:39,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:21:39,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311575183] [2025-01-09 08:21:39,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:21:39,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:21:39,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:21:39,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:21:39,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:21:39,228 INFO L87 Difference]: Start difference. First operand 1258 states and 1870 transitions. Second operand has 5 states, 5 states have (on average 34.4) 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-01-09 08:21:39,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:21:39,605 INFO L93 Difference]: Finished difference Result 2746 states and 4088 transitions. [2025-01-09 08:21:39,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:21:39,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.4) 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-01-09 08:21:39,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:21:39,608 INFO L225 Difference]: With dead ends: 2746 [2025-01-09 08:21:39,608 INFO L226 Difference]: Without dead ends: 1578 [2025-01-09 08:21:39,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-01-09 08:21:39,609 INFO L435 NwaCegarLoop]: 1406 mSDtfsCounter, 788 mSDsluCounter, 4151 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 5557 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 08:21:39,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 5557 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 08:21:39,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2025-01-09 08:21:39,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1258. [2025-01-09 08:21:39,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1257 states have (on average 1.4868735083532219) internal successors, (1869), 1257 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:39,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1869 transitions. [2025-01-09 08:21:39,620 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1869 transitions. Word has length 172 [2025-01-09 08:21:39,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:21:39,620 INFO L471 AbstractCegarLoop]: Abstraction has 1258 states and 1869 transitions. [2025-01-09 08:21:39,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.4) 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-01-09 08:21:39,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1869 transitions. [2025-01-09 08:21:39,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 08:21:39,621 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:21:39,621 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-01-09 08:21:39,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 08:21:39,621 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:21:39,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:21:39,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1601450159, now seen corresponding path program 1 times [2025-01-09 08:21:39,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:21:39,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064432889] [2025-01-09 08:21:39,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:39,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:21:39,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 08:21:40,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 08:21:40,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:40,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:21:41,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:41,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:21:41,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064432889] [2025-01-09 08:21:41,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064432889] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:21:41,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:21:41,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:21:41,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012310955] [2025-01-09 08:21:41,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:21:41,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:21:41,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:21:41,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:21:41,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:21:41,989 INFO L87 Difference]: Start difference. First operand 1258 states and 1869 transitions. Second operand has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 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-01-09 08:21:42,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:21:42,239 INFO L93 Difference]: Finished difference Result 2718 states and 4038 transitions. [2025-01-09 08:21:42,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:21:42,240 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 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-01-09 08:21:42,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:21:42,243 INFO L225 Difference]: With dead ends: 2718 [2025-01-09 08:21:42,243 INFO L226 Difference]: Without dead ends: 1506 [2025-01-09 08:21:42,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-01-09 08:21:42,245 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 2899 mSDsluCounter, 4440 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2899 SdHoareTripleChecker+Valid, 5963 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:21:42,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2899 Valid, 5963 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:21:42,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-01-09 08:21:42,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1258. [2025-01-09 08:21:42,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1257 states have (on average 1.4860779634049324) internal successors, (1868), 1257 states have internal predecessors, (1868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:42,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1868 transitions. [2025-01-09 08:21:42,259 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1868 transitions. Word has length 173 [2025-01-09 08:21:42,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:21:42,259 INFO L471 AbstractCegarLoop]: Abstraction has 1258 states and 1868 transitions. [2025-01-09 08:21:42,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 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-01-09 08:21:42,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1868 transitions. [2025-01-09 08:21:42,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 08:21:42,260 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:21:42,261 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-01-09 08:21:42,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 08:21:42,261 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:21:42,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:21:42,261 INFO L85 PathProgramCache]: Analyzing trace with hash -713891049, now seen corresponding path program 1 times [2025-01-09 08:21:42,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:21:42,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747601748] [2025-01-09 08:21:42,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:42,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:21:42,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 08:21:43,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 08:21:43,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:43,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:21:44,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:44,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:21:44,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747601748] [2025-01-09 08:21:44,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747601748] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:21:44,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:21:44,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:21:44,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561397264] [2025-01-09 08:21:44,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:21:44,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:21:44,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:21:44,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:21:44,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:21:44,974 INFO L87 Difference]: Start difference. First operand 1258 states and 1868 transitions. Second operand has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:45,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:21:45,262 INFO L93 Difference]: Finished difference Result 2918 states and 4348 transitions. [2025-01-09 08:21:45,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:21:45,263 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2025-01-09 08:21:45,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:21:45,265 INFO L225 Difference]: With dead ends: 2918 [2025-01-09 08:21:45,265 INFO L226 Difference]: Without dead ends: 1882 [2025-01-09 08:21:45,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-01-09 08:21:45,267 INFO L435 NwaCegarLoop]: 1455 mSDtfsCounter, 2298 mSDsluCounter, 4300 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2298 SdHoareTripleChecker+Valid, 5755 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 08:21:45,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2298 Valid, 5755 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 08:21:45,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2025-01-09 08:21:45,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1258. [2025-01-09 08:21:45,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1257 states have (on average 1.4852824184566429) internal successors, (1867), 1257 states have internal predecessors, (1867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:45,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1867 transitions. [2025-01-09 08:21:45,278 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1867 transitions. Word has length 174 [2025-01-09 08:21:45,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:21:45,279 INFO L471 AbstractCegarLoop]: Abstraction has 1258 states and 1867 transitions. [2025-01-09 08:21:45,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:45,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1867 transitions. [2025-01-09 08:21:45,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 08:21:45,279 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:21:45,280 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:21:45,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 08:21:45,280 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:21:45,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:21:45,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1971246587, now seen corresponding path program 1 times [2025-01-09 08:21:45,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:21:45,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287323149] [2025-01-09 08:21:45,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:45,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:21:45,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 08:21:46,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 08:21:46,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:46,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:21:47,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:47,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:21:47,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287323149] [2025-01-09 08:21:47,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287323149] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:21:47,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:21:47,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:21:47,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572953686] [2025-01-09 08:21:47,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:21:47,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:21:47,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:21:47,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:21:47,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:21:47,413 INFO L87 Difference]: Start difference. First operand 1258 states and 1867 transitions. Second operand has 5 states, 5 states have (on average 35.0) internal successors, (175), 5 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:47,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:21:47,760 INFO L93 Difference]: Finished difference Result 2918 states and 4347 transitions. [2025-01-09 08:21:47,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:21:47,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.0) internal successors, (175), 5 states have internal predecessors, (175), 0 states have call successors, (0), 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 175 [2025-01-09 08:21:47,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:21:47,765 INFO L225 Difference]: With dead ends: 2918 [2025-01-09 08:21:47,765 INFO L226 Difference]: Without dead ends: 1882 [2025-01-09 08:21:47,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-01-09 08:21:47,767 INFO L435 NwaCegarLoop]: 1405 mSDtfsCounter, 1168 mSDsluCounter, 4147 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 5552 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 08:21:47,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1168 Valid, 5552 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 08:21:47,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2025-01-09 08:21:47,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1258. [2025-01-09 08:21:47,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1257 states have (on average 1.4844868735083532) internal successors, (1866), 1257 states have internal predecessors, (1866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:47,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1866 transitions. [2025-01-09 08:21:47,778 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1866 transitions. Word has length 175 [2025-01-09 08:21:47,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:21:47,778 INFO L471 AbstractCegarLoop]: Abstraction has 1258 states and 1866 transitions. [2025-01-09 08:21:47,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.0) internal successors, (175), 5 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:47,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1866 transitions. [2025-01-09 08:21:47,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 08:21:47,779 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:21:47,779 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:21:47,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 08:21:47,779 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:21:47,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:21:47,780 INFO L85 PathProgramCache]: Analyzing trace with hash 625195892, now seen corresponding path program 1 times [2025-01-09 08:21:47,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:21:47,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564233867] [2025-01-09 08:21:47,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:47,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:21:47,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 08:21:49,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 08:21:49,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:49,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:21:50,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:50,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:21:50,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564233867] [2025-01-09 08:21:50,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564233867] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:21:50,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:21:50,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:21:50,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48805389] [2025-01-09 08:21:50,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:21:50,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:21:50,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:21:50,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:21:50,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:21:50,362 INFO L87 Difference]: Start difference. First operand 1258 states and 1866 transitions. Second operand has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:50,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:21:50,613 INFO L93 Difference]: Finished difference Result 2474 states and 3671 transitions. [2025-01-09 08:21:50,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:21:50,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 176 [2025-01-09 08:21:50,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:21:50,615 INFO L225 Difference]: With dead ends: 2474 [2025-01-09 08:21:50,615 INFO L226 Difference]: Without dead ends: 1266 [2025-01-09 08:21:50,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-01-09 08:21:50,617 INFO L435 NwaCegarLoop]: 1398 mSDtfsCounter, 1540 mSDsluCounter, 2793 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1540 SdHoareTripleChecker+Valid, 4191 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:21:50,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1540 Valid, 4191 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:21:50,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2025-01-09 08:21:50,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1262. [2025-01-09 08:21:50,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1262 states, 1261 states have (on average 1.4829500396510706) internal successors, (1870), 1261 states have internal predecessors, (1870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:50,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 1870 transitions. [2025-01-09 08:21:50,629 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 1870 transitions. Word has length 176 [2025-01-09 08:21:50,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:21:50,629 INFO L471 AbstractCegarLoop]: Abstraction has 1262 states and 1870 transitions. [2025-01-09 08:21:50,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:50,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 1870 transitions. [2025-01-09 08:21:50,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 08:21:50,630 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:21:50,630 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:21:50,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 08:21:50,630 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:21:50,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:21:50,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1207890521, now seen corresponding path program 1 times [2025-01-09 08:21:50,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:21:50,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284558634] [2025-01-09 08:21:50,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:50,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:21:50,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 08:21:52,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 08:21:52,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:52,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:21:54,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:54,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:21:54,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284558634] [2025-01-09 08:21:54,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284558634] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:21:54,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:21:54,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:21:54,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122375566] [2025-01-09 08:21:54,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:21:54,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:21:54,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:21:54,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:21:54,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:21:54,118 INFO L87 Difference]: Start difference. First operand 1262 states and 1870 transitions. Second operand has 6 states, 6 states have (on average 29.5) internal successors, (177), 6 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:54,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:21:54,471 INFO L93 Difference]: Finished difference Result 2799 states and 4158 transitions. [2025-01-09 08:21:54,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:21:54,472 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 6 states have internal predecessors, (177), 0 states have call successors, (0), 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 177 [2025-01-09 08:21:54,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:21:54,474 INFO L225 Difference]: With dead ends: 2799 [2025-01-09 08:21:54,474 INFO L226 Difference]: Without dead ends: 1662 [2025-01-09 08:21:54,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-01-09 08:21:54,476 INFO L435 NwaCegarLoop]: 1459 mSDtfsCounter, 885 mSDsluCounter, 5683 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 7142 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 08:21:54,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 7142 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 08:21:54,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2025-01-09 08:21:54,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 1262. [2025-01-09 08:21:54,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1262 states, 1261 states have (on average 1.4821570182394925) internal successors, (1869), 1261 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:54,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 1869 transitions. [2025-01-09 08:21:54,487 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 1869 transitions. Word has length 177 [2025-01-09 08:21:54,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:21:54,488 INFO L471 AbstractCegarLoop]: Abstraction has 1262 states and 1869 transitions. [2025-01-09 08:21:54,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 6 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:21:54,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 1869 transitions. [2025-01-09 08:21:54,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-09 08:21:54,488 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:21:54,488 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:21:54,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 08:21:54,488 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:21:54,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:21:54,489 INFO L85 PathProgramCache]: Analyzing trace with hash -70953686, now seen corresponding path program 1 times [2025-01-09 08:21:54,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:21:54,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585877252] [2025-01-09 08:21:54,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:54,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:21:54,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 08:21:56,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 08:21:56,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:56,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat