./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_15-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/locks/test_locks_15-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ad13fcacd201ae20f6800b42387b8ec1153fb1bf63cee7a12ec23f4a302be7c7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:49:54,128 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:49:54,165 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:49:54,168 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:49:54,168 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:49:54,182 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:49:54,183 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:49:54,183 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:49:54,183 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:49:54,183 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:49:54,183 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:49:54,184 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:49:54,184 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:49:54,184 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:49:54,184 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:49:54,184 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:49:54,184 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:49:54,184 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:49:54,184 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:49:54,184 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:49:54,185 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:49:54,185 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:49:54,185 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:49:54,185 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:49:54,185 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:49:54,185 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:49:54,185 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:49:54,185 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:49:54,185 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:49:54,185 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:49:54,186 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:49:54,186 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:49:54,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:49:54,186 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:49:54,186 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:49:54,186 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:49:54,186 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:49:54,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:49:54,186 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:49:54,186 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:49:54,186 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:49:54,186 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:49:54,187 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:49:54,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:49:54,187 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:49:54,187 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:49:54,187 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:49:54,187 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:49:54,187 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ad13fcacd201ae20f6800b42387b8ec1153fb1bf63cee7a12ec23f4a302be7c7 [2025-01-08 22:49:54,386 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:49:54,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:49:54,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:49:54,396 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:49:54,396 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:49:54,397 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_15-2.c [2025-01-08 22:49:55,560 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/32ca19b1e/29e330779c0f4bafa9922d6a2eba56b2/FLAG2cb7cffd4 [2025-01-08 22:49:55,771 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:49:55,772 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-2.c [2025-01-08 22:49:55,782 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/32ca19b1e/29e330779c0f4bafa9922d6a2eba56b2/FLAG2cb7cffd4 [2025-01-08 22:49:56,122 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/32ca19b1e/29e330779c0f4bafa9922d6a2eba56b2 [2025-01-08 22:49:56,124 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:49:56,124 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:49:56,125 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:49:56,125 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:49:56,131 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:49:56,131 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:49:56" (1/1) ... [2025-01-08 22:49:56,132 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d839858 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:56, skipping insertion in model container [2025-01-08 22:49:56,132 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:49:56" (1/1) ... [2025-01-08 22:49:56,161 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:49:56,278 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/locks/test_locks_15-2.c[5628,5641] [2025-01-08 22:49:56,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:49:56,291 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:49:56,314 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/locks/test_locks_15-2.c[5628,5641] [2025-01-08 22:49:56,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:49:56,332 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:49:56,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:56 WrapperNode [2025-01-08 22:49:56,333 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:49:56,341 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:49:56,341 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:49:56,341 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:49:56,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:56" (1/1) ... [2025-01-08 22:49:56,349 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:56" (1/1) ... [2025-01-08 22:49:56,363 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 205 [2025-01-08 22:49:56,366 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:49:56,366 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:49:56,366 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:49:56,367 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:49:56,373 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:56" (1/1) ... [2025-01-08 22:49:56,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:56" (1/1) ... [2025-01-08 22:49:56,378 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:56" (1/1) ... [2025-01-08 22:49:56,390 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-08 22:49:56,390 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:56" (1/1) ... [2025-01-08 22:49:56,390 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:56" (1/1) ... [2025-01-08 22:49:56,396 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:56" (1/1) ... [2025-01-08 22:49:56,397 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:56" (1/1) ... [2025-01-08 22:49:56,402 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:56" (1/1) ... [2025-01-08 22:49:56,402 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:56" (1/1) ... [2025-01-08 22:49:56,403 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:56" (1/1) ... [2025-01-08 22:49:56,411 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:49:56,412 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:49:56,412 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:49:56,412 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:49:56,413 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:56" (1/1) ... [2025-01-08 22:49:56,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:49:56,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:49:56,445 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-08 22:49:56,453 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-08 22:49:56,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:49:56,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:49:56,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:49:56,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:49:56,528 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:49:56,529 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:49:56,743 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-01-08 22:49:56,744 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:49:56,753 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:49:56,753 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 22:49:56,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:49:56 BoogieIcfgContainer [2025-01-08 22:49:56,754 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:49:56,756 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:49:56,756 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:49:56,760 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:49:56,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:49:56" (1/3) ... [2025-01-08 22:49:56,760 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@709aa6a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:49:56, skipping insertion in model container [2025-01-08 22:49:56,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:49:56" (2/3) ... [2025-01-08 22:49:56,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@709aa6a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:49:56, skipping insertion in model container [2025-01-08 22:49:56,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:49:56" (3/3) ... [2025-01-08 22:49:56,762 INFO L128 eAbstractionObserver]: Analyzing ICFG test_locks_15-2.c [2025-01-08 22:49:56,774 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:49:56,776 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_locks_15-2.c that has 1 procedures, 55 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 22:49:56,816 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:49:56,826 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;@64ddf61f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:49:56,826 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:49:56,829 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 54 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:56,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-08 22:49:56,832 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:56,833 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] [2025-01-08 22:49:56,833 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:56,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:56,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1780542343, now seen corresponding path program 1 times [2025-01-08 22:49:56,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:56,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105316292] [2025-01-08 22:49:56,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:56,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:56,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-08 22:49:56,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-08 22:49:56,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:56,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:57,034 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-08 22:49:57,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:57,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105316292] [2025-01-08 22:49:57,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105316292] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:57,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:57,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:57,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246071658] [2025-01-08 22:49:57,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:57,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:57,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:57,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:57,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:57,059 INFO L87 Difference]: Start difference. First operand has 55 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 54 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:57,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:57,106 INFO L93 Difference]: Finished difference Result 158 states and 296 transitions. [2025-01-08 22:49:57,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:57,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2025-01-08 22:49:57,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:57,117 INFO L225 Difference]: With dead ends: 158 [2025-01-08 22:49:57,117 INFO L226 Difference]: Without dead ends: 99 [2025-01-08 22:49:57,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:57,123 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 76 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:57,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 197 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:57,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-08 22:49:57,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2025-01-08 22:49:57,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.90625) internal successors, (183), 96 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:57,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 183 transitions. [2025-01-08 22:49:57,161 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 183 transitions. Word has length 22 [2025-01-08 22:49:57,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:57,162 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 183 transitions. [2025-01-08 22:49:57,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:57,162 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 183 transitions. [2025-01-08 22:49:57,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-08 22:49:57,163 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:57,163 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] [2025-01-08 22:49:57,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:49:57,164 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:57,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:57,165 INFO L85 PathProgramCache]: Analyzing trace with hash 213602363, now seen corresponding path program 1 times [2025-01-08 22:49:57,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:57,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650228983] [2025-01-08 22:49:57,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:57,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:57,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-08 22:49:57,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-08 22:49:57,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:57,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:57,248 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-08 22:49:57,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:57,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650228983] [2025-01-08 22:49:57,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650228983] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:57,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:57,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:57,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995238429] [2025-01-08 22:49:57,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:57,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:57,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:57,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:57,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:57,250 INFO L87 Difference]: Start difference. First operand 97 states and 183 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:57,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:57,264 INFO L93 Difference]: Finished difference Result 131 states and 243 transitions. [2025-01-08 22:49:57,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:57,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2025-01-08 22:49:57,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:57,265 INFO L225 Difference]: With dead ends: 131 [2025-01-08 22:49:57,265 INFO L226 Difference]: Without dead ends: 129 [2025-01-08 22:49:57,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:57,266 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 73 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:57,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 270 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:57,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-01-08 22:49:57,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 97. [2025-01-08 22:49:57,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.8958333333333333) internal successors, (182), 96 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:57,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 182 transitions. [2025-01-08 22:49:57,275 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 182 transitions. Word has length 22 [2025-01-08 22:49:57,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:57,275 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 182 transitions. [2025-01-08 22:49:57,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:57,275 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 182 transitions. [2025-01-08 22:49:57,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-08 22:49:57,276 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:57,276 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] [2025-01-08 22:49:57,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:49:57,276 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:57,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:57,277 INFO L85 PathProgramCache]: Analyzing trace with hash 637973938, now seen corresponding path program 1 times [2025-01-08 22:49:57,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:57,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623249616] [2025-01-08 22:49:57,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:57,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:57,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-08 22:49:57,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-08 22:49:57,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:57,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:57,334 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-08 22:49:57,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:57,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623249616] [2025-01-08 22:49:57,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623249616] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:57,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:57,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:57,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534957710] [2025-01-08 22:49:57,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:57,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:57,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:57,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:57,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:57,335 INFO L87 Difference]: Start difference. First operand 97 states and 182 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:57,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:57,353 INFO L93 Difference]: Finished difference Result 190 states and 356 transitions. [2025-01-08 22:49:57,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:57,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2025-01-08 22:49:57,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:57,355 INFO L225 Difference]: With dead ends: 190 [2025-01-08 22:49:57,355 INFO L226 Difference]: Without dead ends: 188 [2025-01-08 22:49:57,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:57,355 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 70 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:57,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 185 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:57,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-01-08 22:49:57,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 130. [2025-01-08 22:49:57,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.8914728682170543) internal successors, (244), 129 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:57,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 244 transitions. [2025-01-08 22:49:57,362 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 244 transitions. Word has length 23 [2025-01-08 22:49:57,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:57,363 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 244 transitions. [2025-01-08 22:49:57,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:57,363 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 244 transitions. [2025-01-08 22:49:57,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-08 22:49:57,363 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:57,363 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] [2025-01-08 22:49:57,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:49:57,364 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:57,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:57,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1356170768, now seen corresponding path program 1 times [2025-01-08 22:49:57,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:57,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788193810] [2025-01-08 22:49:57,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:57,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:57,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-08 22:49:57,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-08 22:49:57,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:57,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:57,424 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-08 22:49:57,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:57,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788193810] [2025-01-08 22:49:57,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788193810] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:57,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:57,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:57,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028919233] [2025-01-08 22:49:57,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:57,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:57,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:57,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:57,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:57,426 INFO L87 Difference]: Start difference. First operand 130 states and 244 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:57,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:57,445 INFO L93 Difference]: Finished difference Result 318 states and 598 transitions. [2025-01-08 22:49:57,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:57,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2025-01-08 22:49:57,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:57,446 INFO L225 Difference]: With dead ends: 318 [2025-01-08 22:49:57,446 INFO L226 Difference]: Without dead ends: 190 [2025-01-08 22:49:57,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:57,447 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 72 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:57,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 214 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:57,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-01-08 22:49:57,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2025-01-08 22:49:57,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.8770053475935828) internal successors, (351), 187 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:57,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 351 transitions. [2025-01-08 22:49:57,454 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 351 transitions. Word has length 23 [2025-01-08 22:49:57,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:57,454 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 351 transitions. [2025-01-08 22:49:57,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:57,455 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 351 transitions. [2025-01-08 22:49:57,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-08 22:49:57,455 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:57,455 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] [2025-01-08 22:49:57,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:49:57,455 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:57,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:57,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1697432338, now seen corresponding path program 1 times [2025-01-08 22:49:57,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:57,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735146437] [2025-01-08 22:49:57,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:57,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:57,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-08 22:49:57,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-08 22:49:57,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:57,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:57,509 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-08 22:49:57,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:57,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735146437] [2025-01-08 22:49:57,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735146437] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:57,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:57,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:57,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648270493] [2025-01-08 22:49:57,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:57,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:57,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:57,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:57,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:57,511 INFO L87 Difference]: Start difference. First operand 188 states and 351 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:57,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:57,535 INFO L93 Difference]: Finished difference Result 288 states and 532 transitions. [2025-01-08 22:49:57,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:57,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-01-08 22:49:57,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:57,536 INFO L225 Difference]: With dead ends: 288 [2025-01-08 22:49:57,536 INFO L226 Difference]: Without dead ends: 195 [2025-01-08 22:49:57,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:57,538 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 74 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:57,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 236 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:57,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-01-08 22:49:57,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2025-01-08 22:49:57,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 1.8489583333333333) internal successors, (355), 192 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:57,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 355 transitions. [2025-01-08 22:49:57,554 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 355 transitions. Word has length 24 [2025-01-08 22:49:57,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:57,554 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 355 transitions. [2025-01-08 22:49:57,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:57,554 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 355 transitions. [2025-01-08 22:49:57,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-08 22:49:57,555 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:57,555 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] [2025-01-08 22:49:57,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 22:49:57,555 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:57,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:57,556 INFO L85 PathProgramCache]: Analyzing trace with hash 908591216, now seen corresponding path program 1 times [2025-01-08 22:49:57,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:57,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512852567] [2025-01-08 22:49:57,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:57,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:57,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-08 22:49:57,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-08 22:49:57,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:57,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:57,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:57,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:57,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512852567] [2025-01-08 22:49:57,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512852567] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:57,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:57,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:57,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698638569] [2025-01-08 22:49:57,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:57,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:57,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:57,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:57,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:57,614 INFO L87 Difference]: Start difference. First operand 193 states and 355 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:57,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:57,633 INFO L93 Difference]: Finished difference Result 369 states and 683 transitions. [2025-01-08 22:49:57,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:57,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-01-08 22:49:57,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:57,634 INFO L225 Difference]: With dead ends: 369 [2025-01-08 22:49:57,635 INFO L226 Difference]: Without dead ends: 367 [2025-01-08 22:49:57,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:57,637 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 67 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:57,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 183 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:57,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-01-08 22:49:57,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 261. [2025-01-08 22:49:57,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 1.8346153846153845) internal successors, (477), 260 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:57,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 477 transitions. [2025-01-08 22:49:57,649 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 477 transitions. Word has length 24 [2025-01-08 22:49:57,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:57,649 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 477 transitions. [2025-01-08 22:49:57,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:57,650 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 477 transitions. [2025-01-08 22:49:57,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-08 22:49:57,651 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:57,651 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] [2025-01-08 22:49:57,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 22:49:57,651 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:57,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:57,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1085553490, now seen corresponding path program 1 times [2025-01-08 22:49:57,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:57,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410866590] [2025-01-08 22:49:57,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:57,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:57,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-08 22:49:57,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-08 22:49:57,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:57,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:57,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-08 22:49:57,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:57,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410866590] [2025-01-08 22:49:57,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410866590] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:57,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:57,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:57,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370433722] [2025-01-08 22:49:57,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:57,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:57,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:57,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:57,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:57,702 INFO L87 Difference]: Start difference. First operand 261 states and 477 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:57,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:57,728 INFO L93 Difference]: Finished difference Result 629 states and 1155 transitions. [2025-01-08 22:49:57,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:57,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-01-08 22:49:57,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:57,730 INFO L225 Difference]: With dead ends: 629 [2025-01-08 22:49:57,730 INFO L226 Difference]: Without dead ends: 375 [2025-01-08 22:49:57,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:57,733 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 71 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:57,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 215 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:57,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-01-08 22:49:57,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 373. [2025-01-08 22:49:57,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 372 states have (on average 1.825268817204301) internal successors, (679), 372 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:57,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 679 transitions. [2025-01-08 22:49:57,751 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 679 transitions. Word has length 24 [2025-01-08 22:49:57,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:57,751 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 679 transitions. [2025-01-08 22:49:57,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:57,751 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 679 transitions. [2025-01-08 22:49:57,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-08 22:49:57,755 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:57,755 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] [2025-01-08 22:49:57,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 22:49:57,755 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:57,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:57,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1898230971, now seen corresponding path program 1 times [2025-01-08 22:49:57,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:57,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061510233] [2025-01-08 22:49:57,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:57,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:57,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-08 22:49:57,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-08 22:49:57,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:57,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:57,782 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-08 22:49:57,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:57,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061510233] [2025-01-08 22:49:57,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061510233] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:57,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:57,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:57,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565564204] [2025-01-08 22:49:57,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:57,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:57,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:57,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:57,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:57,784 INFO L87 Difference]: Start difference. First operand 373 states and 679 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:57,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:57,802 INFO L93 Difference]: Finished difference Result 561 states and 1017 transitions. [2025-01-08 22:49:57,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:57,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2025-01-08 22:49:57,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:57,804 INFO L225 Difference]: With dead ends: 561 [2025-01-08 22:49:57,804 INFO L226 Difference]: Without dead ends: 379 [2025-01-08 22:49:57,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:57,806 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 73 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:57,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 232 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:57,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-01-08 22:49:57,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 377. [2025-01-08 22:49:57,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 1.8058510638297873) internal successors, (679), 376 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:57,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 679 transitions. [2025-01-08 22:49:57,819 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 679 transitions. Word has length 25 [2025-01-08 22:49:57,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:57,820 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 679 transitions. [2025-01-08 22:49:57,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:57,820 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 679 transitions. [2025-01-08 22:49:57,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-08 22:49:57,820 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:57,820 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] [2025-01-08 22:49:57,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 22:49:57,821 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:57,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:57,821 INFO L85 PathProgramCache]: Analyzing trace with hash 707792583, now seen corresponding path program 1 times [2025-01-08 22:49:57,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:57,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701608785] [2025-01-08 22:49:57,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:57,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:57,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-08 22:49:57,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-08 22:49:57,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:57,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:57,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:49:57,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:57,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701608785] [2025-01-08 22:49:57,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701608785] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:57,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:57,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:57,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033435859] [2025-01-08 22:49:57,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:57,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:57,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:57,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:57,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:57,848 INFO L87 Difference]: Start difference. First operand 377 states and 679 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:57,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:57,864 INFO L93 Difference]: Finished difference Result 713 states and 1297 transitions. [2025-01-08 22:49:57,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:57,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2025-01-08 22:49:57,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:57,866 INFO L225 Difference]: With dead ends: 713 [2025-01-08 22:49:57,866 INFO L226 Difference]: Without dead ends: 711 [2025-01-08 22:49:57,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:57,868 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 64 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:57,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 181 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:57,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2025-01-08 22:49:57,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 517. [2025-01-08 22:49:57,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 516 states have (on average 1.7810077519379846) internal successors, (919), 516 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:57,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 919 transitions. [2025-01-08 22:49:57,883 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 919 transitions. Word has length 25 [2025-01-08 22:49:57,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:57,884 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 919 transitions. [2025-01-08 22:49:57,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:57,884 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 919 transitions. [2025-01-08 22:49:57,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-08 22:49:57,884 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:57,885 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] [2025-01-08 22:49:57,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 22:49:57,885 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:57,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:57,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1286352123, now seen corresponding path program 1 times [2025-01-08 22:49:57,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:57,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686162326] [2025-01-08 22:49:57,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:57,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:57,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-08 22:49:57,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-08 22:49:57,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:57,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:57,921 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-08 22:49:57,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:57,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686162326] [2025-01-08 22:49:57,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686162326] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:57,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:57,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:57,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025525640] [2025-01-08 22:49:57,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:57,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:57,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:57,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:57,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:57,925 INFO L87 Difference]: Start difference. First operand 517 states and 919 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:57,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:57,945 INFO L93 Difference]: Finished difference Result 1241 states and 2217 transitions. [2025-01-08 22:49:57,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:57,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2025-01-08 22:49:57,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:57,948 INFO L225 Difference]: With dead ends: 1241 [2025-01-08 22:49:57,948 INFO L226 Difference]: Without dead ends: 735 [2025-01-08 22:49:57,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:57,949 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 70 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:57,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 216 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:57,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2025-01-08 22:49:57,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 733. [2025-01-08 22:49:57,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 732 states have (on average 1.7745901639344261) internal successors, (1299), 732 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:57,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1299 transitions. [2025-01-08 22:49:57,973 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1299 transitions. Word has length 25 [2025-01-08 22:49:57,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:57,973 INFO L471 AbstractCegarLoop]: Abstraction has 733 states and 1299 transitions. [2025-01-08 22:49:57,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:57,974 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1299 transitions. [2025-01-08 22:49:57,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-08 22:49:57,976 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:57,976 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] [2025-01-08 22:49:57,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 22:49:57,977 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:57,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:57,977 INFO L85 PathProgramCache]: Analyzing trace with hash 466946339, now seen corresponding path program 1 times [2025-01-08 22:49:57,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:57,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505875946] [2025-01-08 22:49:57,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:57,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:57,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-08 22:49:57,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-08 22:49:57,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:57,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:58,009 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-08 22:49:58,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:58,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505875946] [2025-01-08 22:49:58,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505875946] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:58,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:58,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:58,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601270371] [2025-01-08 22:49:58,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:58,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:58,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:58,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:58,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:58,012 INFO L87 Difference]: Start difference. First operand 733 states and 1299 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:58,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:58,031 INFO L93 Difference]: Finished difference Result 1101 states and 1945 transitions. [2025-01-08 22:49:58,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:58,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2025-01-08 22:49:58,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:58,035 INFO L225 Difference]: With dead ends: 1101 [2025-01-08 22:49:58,035 INFO L226 Difference]: Without dead ends: 743 [2025-01-08 22:49:58,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:58,036 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 72 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:58,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 228 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:58,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2025-01-08 22:49:58,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 741. [2025-01-08 22:49:58,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 740 states have (on average 1.7554054054054054) internal successors, (1299), 740 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:58,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1299 transitions. [2025-01-08 22:49:58,055 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1299 transitions. Word has length 26 [2025-01-08 22:49:58,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:58,055 INFO L471 AbstractCegarLoop]: Abstraction has 741 states and 1299 transitions. [2025-01-08 22:49:58,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:58,056 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1299 transitions. [2025-01-08 22:49:58,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-08 22:49:58,057 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:58,057 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] [2025-01-08 22:49:58,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 22:49:58,057 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:58,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:58,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1221997403, now seen corresponding path program 1 times [2025-01-08 22:49:58,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:58,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595590794] [2025-01-08 22:49:58,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:58,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:58,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-08 22:49:58,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-08 22:49:58,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:58,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:58,094 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-08 22:49:58,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:58,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595590794] [2025-01-08 22:49:58,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595590794] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:58,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:58,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:58,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836095475] [2025-01-08 22:49:58,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:58,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:58,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:58,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:58,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:58,096 INFO L87 Difference]: Start difference. First operand 741 states and 1299 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:58,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:58,119 INFO L93 Difference]: Finished difference Result 1385 states and 2461 transitions. [2025-01-08 22:49:58,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:58,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2025-01-08 22:49:58,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:58,124 INFO L225 Difference]: With dead ends: 1385 [2025-01-08 22:49:58,124 INFO L226 Difference]: Without dead ends: 1383 [2025-01-08 22:49:58,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:58,126 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 61 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:58,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 179 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:58,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2025-01-08 22:49:58,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1029. [2025-01-08 22:49:58,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 1028 states have (on average 1.722762645914397) internal successors, (1771), 1028 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:58,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1771 transitions. [2025-01-08 22:49:58,150 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1771 transitions. Word has length 26 [2025-01-08 22:49:58,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:58,151 INFO L471 AbstractCegarLoop]: Abstraction has 1029 states and 1771 transitions. [2025-01-08 22:49:58,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:58,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1771 transitions. [2025-01-08 22:49:58,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-08 22:49:58,154 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:58,154 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] [2025-01-08 22:49:58,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 22:49:58,154 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:58,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:58,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1078825187, now seen corresponding path program 1 times [2025-01-08 22:49:58,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:58,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165331029] [2025-01-08 22:49:58,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:58,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:58,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-08 22:49:58,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-08 22:49:58,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:58,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:58,192 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-08 22:49:58,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:58,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165331029] [2025-01-08 22:49:58,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165331029] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:58,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:58,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:58,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176091203] [2025-01-08 22:49:58,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:58,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:58,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:58,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:58,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:58,193 INFO L87 Difference]: Start difference. First operand 1029 states and 1771 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:58,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:58,217 INFO L93 Difference]: Finished difference Result 2457 states and 4253 transitions. [2025-01-08 22:49:58,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:58,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2025-01-08 22:49:58,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:58,221 INFO L225 Difference]: With dead ends: 2457 [2025-01-08 22:49:58,222 INFO L226 Difference]: Without dead ends: 1447 [2025-01-08 22:49:58,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:58,223 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 69 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:58,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 217 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:58,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2025-01-08 22:49:58,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1445. [2025-01-08 22:49:58,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.7195290858725762) internal successors, (2483), 1444 states have internal predecessors, (2483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:58,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 2483 transitions. [2025-01-08 22:49:58,250 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 2483 transitions. Word has length 26 [2025-01-08 22:49:58,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:58,251 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 2483 transitions. [2025-01-08 22:49:58,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:58,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 2483 transitions. [2025-01-08 22:49:58,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-08 22:49:58,252 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:58,252 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] [2025-01-08 22:49:58,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 22:49:58,252 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:58,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:58,252 INFO L85 PathProgramCache]: Analyzing trace with hash 772999258, now seen corresponding path program 1 times [2025-01-08 22:49:58,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:58,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245216457] [2025-01-08 22:49:58,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:58,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:58,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-08 22:49:58,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-08 22:49:58,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:58,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:58,270 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-08 22:49:58,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:58,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245216457] [2025-01-08 22:49:58,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245216457] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:58,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:58,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:58,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136274235] [2025-01-08 22:49:58,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:58,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:58,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:58,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:58,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:58,271 INFO L87 Difference]: Start difference. First operand 1445 states and 2483 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:58,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:58,294 INFO L93 Difference]: Finished difference Result 2169 states and 3717 transitions. [2025-01-08 22:49:58,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:58,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2025-01-08 22:49:58,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:58,298 INFO L225 Difference]: With dead ends: 2169 [2025-01-08 22:49:58,298 INFO L226 Difference]: Without dead ends: 1463 [2025-01-08 22:49:58,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:58,299 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 71 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:58,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 224 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:58,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2025-01-08 22:49:58,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1461. [2025-01-08 22:49:58,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1461 states, 1460 states have (on average 1.7006849315068493) internal successors, (2483), 1460 states have internal predecessors, (2483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:58,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 2483 transitions. [2025-01-08 22:49:58,327 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 2483 transitions. Word has length 27 [2025-01-08 22:49:58,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:58,327 INFO L471 AbstractCegarLoop]: Abstraction has 1461 states and 2483 transitions. [2025-01-08 22:49:58,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:58,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 2483 transitions. [2025-01-08 22:49:58,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-08 22:49:58,328 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:58,328 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] [2025-01-08 22:49:58,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 22:49:58,328 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:58,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:58,329 INFO L85 PathProgramCache]: Analyzing trace with hash -915944484, now seen corresponding path program 1 times [2025-01-08 22:49:58,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:58,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568819905] [2025-01-08 22:49:58,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:58,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:58,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-08 22:49:58,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-08 22:49:58,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:58,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:58,345 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-08 22:49:58,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:58,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568819905] [2025-01-08 22:49:58,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568819905] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:58,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:58,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:58,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205947115] [2025-01-08 22:49:58,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:58,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:58,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:58,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:58,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:58,346 INFO L87 Difference]: Start difference. First operand 1461 states and 2483 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:58,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:58,375 INFO L93 Difference]: Finished difference Result 2697 states and 4661 transitions. [2025-01-08 22:49:58,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:58,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2025-01-08 22:49:58,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:58,382 INFO L225 Difference]: With dead ends: 2697 [2025-01-08 22:49:58,382 INFO L226 Difference]: Without dead ends: 2695 [2025-01-08 22:49:58,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:58,383 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 58 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:58,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 177 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:58,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2695 states. [2025-01-08 22:49:58,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2695 to 2053. [2025-01-08 22:49:58,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2053 states, 2052 states have (on average 1.662280701754386) internal successors, (3411), 2052 states have internal predecessors, (3411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:58,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 3411 transitions. [2025-01-08 22:49:58,421 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 3411 transitions. Word has length 27 [2025-01-08 22:49:58,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:58,421 INFO L471 AbstractCegarLoop]: Abstraction has 2053 states and 3411 transitions. [2025-01-08 22:49:58,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:58,421 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 3411 transitions. [2025-01-08 22:49:58,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-08 22:49:58,423 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:58,423 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] [2025-01-08 22:49:58,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-08 22:49:58,423 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:58,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:58,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1384878106, now seen corresponding path program 1 times [2025-01-08 22:49:58,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:58,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757268049] [2025-01-08 22:49:58,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:58,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:58,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-08 22:49:58,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-08 22:49:58,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:58,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:58,459 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-08 22:49:58,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:58,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757268049] [2025-01-08 22:49:58,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757268049] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:58,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:58,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:58,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99460617] [2025-01-08 22:49:58,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:58,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:58,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:58,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:58,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:58,460 INFO L87 Difference]: Start difference. First operand 2053 states and 3411 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:58,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:58,499 INFO L93 Difference]: Finished difference Result 4873 states and 8149 transitions. [2025-01-08 22:49:58,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:58,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2025-01-08 22:49:58,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:58,506 INFO L225 Difference]: With dead ends: 4873 [2025-01-08 22:49:58,506 INFO L226 Difference]: Without dead ends: 2855 [2025-01-08 22:49:58,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:58,509 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 68 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:58,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 218 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:58,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2855 states. [2025-01-08 22:49:58,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2855 to 2853. [2025-01-08 22:49:58,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2853 states, 2852 states have (on average 1.66164095371669) internal successors, (4739), 2852 states have internal predecessors, (4739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:58,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 4739 transitions. [2025-01-08 22:49:58,565 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 4739 transitions. Word has length 27 [2025-01-08 22:49:58,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:58,566 INFO L471 AbstractCegarLoop]: Abstraction has 2853 states and 4739 transitions. [2025-01-08 22:49:58,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:58,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 4739 transitions. [2025-01-08 22:49:58,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-08 22:49:58,568 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:58,568 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] [2025-01-08 22:49:58,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-08 22:49:58,568 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:58,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:58,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1670705496, now seen corresponding path program 1 times [2025-01-08 22:49:58,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:58,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356748648] [2025-01-08 22:49:58,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:58,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:58,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-08 22:49:58,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-08 22:49:58,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:58,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:58,590 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-08 22:49:58,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:58,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356748648] [2025-01-08 22:49:58,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356748648] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:58,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:58,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:58,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877883033] [2025-01-08 22:49:58,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:58,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:58,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:58,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:58,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:58,595 INFO L87 Difference]: Start difference. First operand 2853 states and 4739 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:58,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:58,653 INFO L93 Difference]: Finished difference Result 4281 states and 7093 transitions. [2025-01-08 22:49:58,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:58,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-01-08 22:49:58,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:58,660 INFO L225 Difference]: With dead ends: 4281 [2025-01-08 22:49:58,661 INFO L226 Difference]: Without dead ends: 2887 [2025-01-08 22:49:58,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:58,663 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 70 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:58,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 220 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:58,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2025-01-08 22:49:58,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 2885. [2025-01-08 22:49:58,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2885 states, 2884 states have (on average 1.6432038834951457) internal successors, (4739), 2884 states have internal predecessors, (4739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:58,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2885 states to 2885 states and 4739 transitions. [2025-01-08 22:49:58,752 INFO L78 Accepts]: Start accepts. Automaton has 2885 states and 4739 transitions. Word has length 28 [2025-01-08 22:49:58,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:58,753 INFO L471 AbstractCegarLoop]: Abstraction has 2885 states and 4739 transitions. [2025-01-08 22:49:58,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:58,753 INFO L276 IsEmpty]: Start isEmpty. Operand 2885 states and 4739 transitions. [2025-01-08 22:49:58,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-08 22:49:58,755 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:58,755 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] [2025-01-08 22:49:58,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-08 22:49:58,755 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:58,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:58,756 INFO L85 PathProgramCache]: Analyzing trace with hash -18238246, now seen corresponding path program 1 times [2025-01-08 22:49:58,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:58,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737598950] [2025-01-08 22:49:58,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:58,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:58,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-08 22:49:58,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-08 22:49:58,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:58,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:58,776 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-08 22:49:58,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:58,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737598950] [2025-01-08 22:49:58,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737598950] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:58,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:58,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:58,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420856895] [2025-01-08 22:49:58,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:58,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:58,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:58,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:58,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:58,777 INFO L87 Difference]: Start difference. First operand 2885 states and 4739 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:58,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:58,835 INFO L93 Difference]: Finished difference Result 5257 states and 8805 transitions. [2025-01-08 22:49:58,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:58,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-01-08 22:49:58,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:58,848 INFO L225 Difference]: With dead ends: 5257 [2025-01-08 22:49:58,848 INFO L226 Difference]: Without dead ends: 5255 [2025-01-08 22:49:58,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:58,850 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 55 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:58,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 175 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:58,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5255 states. [2025-01-08 22:49:58,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5255 to 4101. [2025-01-08 22:49:58,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4101 states, 4100 states have (on average 1.6007317073170733) internal successors, (6563), 4100 states have internal predecessors, (6563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:58,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 6563 transitions. [2025-01-08 22:49:58,975 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 6563 transitions. Word has length 28 [2025-01-08 22:49:58,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:58,975 INFO L471 AbstractCegarLoop]: Abstraction has 4101 states and 6563 transitions. [2025-01-08 22:49:58,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:58,975 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 6563 transitions. [2025-01-08 22:49:58,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-08 22:49:58,978 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:58,978 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] [2025-01-08 22:49:58,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-08 22:49:58,978 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:58,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:58,979 INFO L85 PathProgramCache]: Analyzing trace with hash -2012382952, now seen corresponding path program 1 times [2025-01-08 22:49:58,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:58,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072122585] [2025-01-08 22:49:58,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:58,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:58,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-08 22:49:58,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-08 22:49:58,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:58,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:59,003 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-08 22:49:59,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:59,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072122585] [2025-01-08 22:49:59,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072122585] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:59,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:59,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:59,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748728484] [2025-01-08 22:49:59,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:59,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:59,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:59,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:59,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:59,004 INFO L87 Difference]: Start difference. First operand 4101 states and 6563 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:59,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:59,081 INFO L93 Difference]: Finished difference Result 9673 states and 15589 transitions. [2025-01-08 22:49:59,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:59,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-01-08 22:49:59,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:59,099 INFO L225 Difference]: With dead ends: 9673 [2025-01-08 22:49:59,099 INFO L226 Difference]: Without dead ends: 5639 [2025-01-08 22:49:59,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:59,103 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 67 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:59,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 219 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:59,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5639 states. [2025-01-08 22:49:59,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5639 to 5637. [2025-01-08 22:49:59,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5637 states, 5636 states have (on average 1.60166784953868) internal successors, (9027), 5636 states have internal predecessors, (9027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:59,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5637 states to 5637 states and 9027 transitions. [2025-01-08 22:49:59,283 INFO L78 Accepts]: Start accepts. Automaton has 5637 states and 9027 transitions. Word has length 28 [2025-01-08 22:49:59,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:59,283 INFO L471 AbstractCegarLoop]: Abstraction has 5637 states and 9027 transitions. [2025-01-08 22:49:59,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:59,284 INFO L276 IsEmpty]: Start isEmpty. Operand 5637 states and 9027 transitions. [2025-01-08 22:49:59,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-08 22:49:59,296 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:59,296 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] [2025-01-08 22:49:59,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-08 22:49:59,296 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:59,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:59,296 INFO L85 PathProgramCache]: Analyzing trace with hash -565171857, now seen corresponding path program 1 times [2025-01-08 22:49:59,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:59,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422143544] [2025-01-08 22:49:59,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:59,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:59,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-08 22:49:59,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-08 22:49:59,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:59,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:59,333 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-08 22:49:59,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:59,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422143544] [2025-01-08 22:49:59,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422143544] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:59,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:59,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:59,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523707773] [2025-01-08 22:49:59,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:59,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:59,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:59,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:59,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:59,334 INFO L87 Difference]: Start difference. First operand 5637 states and 9027 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:59,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:59,413 INFO L93 Difference]: Finished difference Result 8457 states and 13509 transitions. [2025-01-08 22:49:59,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:59,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-01-08 22:49:59,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:59,422 INFO L225 Difference]: With dead ends: 8457 [2025-01-08 22:49:59,423 INFO L226 Difference]: Without dead ends: 5703 [2025-01-08 22:49:59,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:59,426 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 69 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:59,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 216 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:59,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5703 states. [2025-01-08 22:49:59,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5703 to 5701. [2025-01-08 22:49:59,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5701 states, 5700 states have (on average 1.5836842105263158) internal successors, (9027), 5700 states have internal predecessors, (9027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:59,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5701 states to 5701 states and 9027 transitions. [2025-01-08 22:49:59,566 INFO L78 Accepts]: Start accepts. Automaton has 5701 states and 9027 transitions. Word has length 29 [2025-01-08 22:49:59,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:59,566 INFO L471 AbstractCegarLoop]: Abstraction has 5701 states and 9027 transitions. [2025-01-08 22:49:59,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:59,566 INFO L276 IsEmpty]: Start isEmpty. Operand 5701 states and 9027 transitions. [2025-01-08 22:49:59,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-08 22:49:59,570 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:59,570 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] [2025-01-08 22:49:59,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-08 22:49:59,570 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:59,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:59,570 INFO L85 PathProgramCache]: Analyzing trace with hash 2040851697, now seen corresponding path program 1 times [2025-01-08 22:49:59,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:59,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216641892] [2025-01-08 22:49:59,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:59,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:59,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-08 22:49:59,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-08 22:49:59,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:59,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:59,589 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-08 22:49:59,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:59,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216641892] [2025-01-08 22:49:59,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216641892] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:59,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:59,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:59,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667238279] [2025-01-08 22:49:59,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:59,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:59,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:59,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:59,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:59,590 INFO L87 Difference]: Start difference. First operand 5701 states and 9027 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:59,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:49:59,736 INFO L93 Difference]: Finished difference Result 10249 states and 16581 transitions. [2025-01-08 22:49:59,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:49:59,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-01-08 22:49:59,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:49:59,749 INFO L225 Difference]: With dead ends: 10249 [2025-01-08 22:49:59,750 INFO L226 Difference]: Without dead ends: 10247 [2025-01-08 22:49:59,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:59,752 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 52 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:49:59,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 173 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:49:59,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10247 states. [2025-01-08 22:49:59,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10247 to 8197. [2025-01-08 22:49:59,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8197 states, 8196 states have (on average 1.5386774036115178) internal successors, (12611), 8196 states have internal predecessors, (12611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:59,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8197 states to 8197 states and 12611 transitions. [2025-01-08 22:49:59,890 INFO L78 Accepts]: Start accepts. Automaton has 8197 states and 12611 transitions. Word has length 29 [2025-01-08 22:49:59,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:49:59,890 INFO L471 AbstractCegarLoop]: Abstraction has 8197 states and 12611 transitions. [2025-01-08 22:49:59,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:49:59,890 INFO L276 IsEmpty]: Start isEmpty. Operand 8197 states and 12611 transitions. [2025-01-08 22:49:59,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-08 22:49:59,896 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:49:59,896 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] [2025-01-08 22:49:59,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-08 22:49:59,896 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:49:59,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:49:59,897 INFO L85 PathProgramCache]: Analyzing trace with hash 46706991, now seen corresponding path program 1 times [2025-01-08 22:49:59,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:49:59,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659590115] [2025-01-08 22:49:59,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:49:59,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:49:59,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-08 22:49:59,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-08 22:49:59,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:49:59,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:49:59,915 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-08 22:49:59,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:49:59,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659590115] [2025-01-08 22:49:59,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659590115] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:49:59,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:49:59,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:49:59,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313686088] [2025-01-08 22:49:59,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:49:59,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:49:59,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:49:59,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:49:59,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:49:59,917 INFO L87 Difference]: Start difference. First operand 8197 states and 12611 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:00,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:00,020 INFO L93 Difference]: Finished difference Result 19209 states and 29765 transitions. [2025-01-08 22:50:00,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:50:00,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-01-08 22:50:00,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:00,038 INFO L225 Difference]: With dead ends: 19209 [2025-01-08 22:50:00,038 INFO L226 Difference]: Without dead ends: 11143 [2025-01-08 22:50:00,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:50:00,047 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 66 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:00,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 220 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:50:00,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11143 states. [2025-01-08 22:50:00,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11143 to 11141. [2025-01-08 22:50:00,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11141 states, 11140 states have (on average 1.5399461400359067) internal successors, (17155), 11140 states have internal predecessors, (17155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:00,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11141 states to 11141 states and 17155 transitions. [2025-01-08 22:50:00,287 INFO L78 Accepts]: Start accepts. Automaton has 11141 states and 17155 transitions. Word has length 29 [2025-01-08 22:50:00,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:00,287 INFO L471 AbstractCegarLoop]: Abstraction has 11141 states and 17155 transitions. [2025-01-08 22:50:00,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:00,287 INFO L276 IsEmpty]: Start isEmpty. Operand 11141 states and 17155 transitions. [2025-01-08 22:50:00,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-08 22:50:00,293 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:00,294 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] [2025-01-08 22:50:00,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-08 22:50:00,294 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:00,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:00,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1157892723, now seen corresponding path program 1 times [2025-01-08 22:50:00,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:00,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084295654] [2025-01-08 22:50:00,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:00,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:00,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-08 22:50:00,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-08 22:50:00,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:00,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:00,309 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-08 22:50:00,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:00,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084295654] [2025-01-08 22:50:00,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084295654] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:00,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:00,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:50:00,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26171874] [2025-01-08 22:50:00,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:00,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:50:00,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:00,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:50:00,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:50:00,310 INFO L87 Difference]: Start difference. First operand 11141 states and 17155 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:00,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:00,455 INFO L93 Difference]: Finished difference Result 16713 states and 25669 transitions. [2025-01-08 22:50:00,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:50:00,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2025-01-08 22:50:00,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:00,469 INFO L225 Difference]: With dead ends: 16713 [2025-01-08 22:50:00,469 INFO L226 Difference]: Without dead ends: 11271 [2025-01-08 22:50:00,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:50:00,473 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 68 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:00,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 212 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:50:00,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11271 states. [2025-01-08 22:50:00,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11271 to 11269. [2025-01-08 22:50:00,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11269 states, 11268 states have (on average 1.522452964146255) internal successors, (17155), 11268 states have internal predecessors, (17155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:00,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11269 states to 11269 states and 17155 transitions. [2025-01-08 22:50:00,629 INFO L78 Accepts]: Start accepts. Automaton has 11269 states and 17155 transitions. Word has length 30 [2025-01-08 22:50:00,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:00,629 INFO L471 AbstractCegarLoop]: Abstraction has 11269 states and 17155 transitions. [2025-01-08 22:50:00,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:00,630 INFO L276 IsEmpty]: Start isEmpty. Operand 11269 states and 17155 transitions. [2025-01-08 22:50:00,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-08 22:50:00,636 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:00,636 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] [2025-01-08 22:50:00,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-08 22:50:00,636 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:00,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:00,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1448130831, now seen corresponding path program 1 times [2025-01-08 22:50:00,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:00,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261248620] [2025-01-08 22:50:00,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:00,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:00,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-08 22:50:00,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-08 22:50:00,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:00,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:00,651 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-08 22:50:00,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:00,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261248620] [2025-01-08 22:50:00,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261248620] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:00,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:00,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:50:00,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212944443] [2025-01-08 22:50:00,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:00,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:50:00,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:00,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:50:00,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:50:00,653 INFO L87 Difference]: Start difference. First operand 11269 states and 17155 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:00,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:00,907 INFO L93 Difference]: Finished difference Result 33033 states and 49925 transitions. [2025-01-08 22:50:00,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:50:00,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2025-01-08 22:50:00,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:00,941 INFO L225 Difference]: With dead ends: 33033 [2025-01-08 22:50:00,942 INFO L226 Difference]: Without dead ends: 22023 [2025-01-08 22:50:00,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:50:00,954 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 66 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:00,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 187 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:50:00,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22023 states. [2025-01-08 22:50:01,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22023 to 22021. [2025-01-08 22:50:01,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22021 states, 22020 states have (on average 1.488237965485922) internal successors, (32771), 22020 states have internal predecessors, (32771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:01,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22021 states to 22021 states and 32771 transitions. [2025-01-08 22:50:01,399 INFO L78 Accepts]: Start accepts. Automaton has 22021 states and 32771 transitions. Word has length 30 [2025-01-08 22:50:01,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:01,399 INFO L471 AbstractCegarLoop]: Abstraction has 22021 states and 32771 transitions. [2025-01-08 22:50:01,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:01,400 INFO L276 IsEmpty]: Start isEmpty. Operand 22021 states and 32771 transitions. [2025-01-08 22:50:01,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-08 22:50:01,411 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:01,411 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] [2025-01-08 22:50:01,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-08 22:50:01,412 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:01,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:01,412 INFO L85 PathProgramCache]: Analyzing trace with hash -852691759, now seen corresponding path program 1 times [2025-01-08 22:50:01,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:01,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24140734] [2025-01-08 22:50:01,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:01,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:01,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-08 22:50:01,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-08 22:50:01,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:01,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:01,426 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-08 22:50:01,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:01,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24140734] [2025-01-08 22:50:01,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24140734] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:01,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:01,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:50:01,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475692235] [2025-01-08 22:50:01,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:01,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:50:01,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:01,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:50:01,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:50:01,428 INFO L87 Difference]: Start difference. First operand 22021 states and 32771 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:01,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:01,623 INFO L93 Difference]: Finished difference Result 25609 states and 39429 transitions. [2025-01-08 22:50:01,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:50:01,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2025-01-08 22:50:01,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:01,663 INFO L225 Difference]: With dead ends: 25609 [2025-01-08 22:50:01,664 INFO L226 Difference]: Without dead ends: 25607 [2025-01-08 22:50:01,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:50:01,671 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 49 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:01,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 230 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:50:01,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25607 states. [2025-01-08 22:50:01,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25607 to 22021. [2025-01-08 22:50:01,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22021 states, 22020 states have (on average 1.4766121707538602) internal successors, (32515), 22020 states have internal predecessors, (32515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:02,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22021 states to 22021 states and 32515 transitions. [2025-01-08 22:50:02,012 INFO L78 Accepts]: Start accepts. Automaton has 22021 states and 32515 transitions. Word has length 30 [2025-01-08 22:50:02,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:02,012 INFO L471 AbstractCegarLoop]: Abstraction has 22021 states and 32515 transitions. [2025-01-08 22:50:02,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:02,012 INFO L276 IsEmpty]: Start isEmpty. Operand 22021 states and 32515 transitions. [2025-01-08 22:50:02,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-08 22:50:02,025 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:02,025 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] [2025-01-08 22:50:02,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-08 22:50:02,025 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:02,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:02,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1942597252, now seen corresponding path program 1 times [2025-01-08 22:50:02,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:02,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289922096] [2025-01-08 22:50:02,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:02,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:02,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-08 22:50:02,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-08 22:50:02,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:02,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:02,041 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-08 22:50:02,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:02,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289922096] [2025-01-08 22:50:02,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289922096] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:02,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:02,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:50:02,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009787571] [2025-01-08 22:50:02,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:02,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:50:02,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:02,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:50:02,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:50:02,043 INFO L87 Difference]: Start difference. First operand 22021 states and 32515 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:02,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:02,257 INFO L93 Difference]: Finished difference Result 38665 states and 58373 transitions. [2025-01-08 22:50:02,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:50:02,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2025-01-08 22:50:02,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:02,314 INFO L225 Difference]: With dead ends: 38665 [2025-01-08 22:50:02,314 INFO L226 Difference]: Without dead ends: 38663 [2025-01-08 22:50:02,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:50:02,325 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 46 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:02,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 169 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:50:02,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38663 states. [2025-01-08 22:50:02,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38663 to 32517. [2025-01-08 22:50:02,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32517 states, 32516 states have (on average 1.4329868372493542) internal successors, (46595), 32516 states have internal predecessors, (46595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:02,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32517 states to 32517 states and 46595 transitions. [2025-01-08 22:50:02,726 INFO L78 Accepts]: Start accepts. Automaton has 32517 states and 46595 transitions. Word has length 31 [2025-01-08 22:50:02,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:02,726 INFO L471 AbstractCegarLoop]: Abstraction has 32517 states and 46595 transitions. [2025-01-08 22:50:02,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:02,726 INFO L276 IsEmpty]: Start isEmpty. Operand 32517 states and 46595 transitions. [2025-01-08 22:50:02,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-08 22:50:02,747 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:02,747 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] [2025-01-08 22:50:02,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-08 22:50:02,747 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:02,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:02,748 INFO L85 PathProgramCache]: Analyzing trace with hash -51547454, now seen corresponding path program 1 times [2025-01-08 22:50:02,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:02,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451090978] [2025-01-08 22:50:02,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:02,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:02,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-08 22:50:02,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-08 22:50:02,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:02,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:02,763 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-08 22:50:02,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:02,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451090978] [2025-01-08 22:50:02,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451090978] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:02,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:02,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:50:02,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501705090] [2025-01-08 22:50:02,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:02,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:50:02,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:02,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:50:02,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:50:02,765 INFO L87 Difference]: Start difference. First operand 32517 states and 46595 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:03,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:03,232 INFO L93 Difference]: Finished difference Result 75529 states and 109061 transitions. [2025-01-08 22:50:03,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:50:03,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2025-01-08 22:50:03,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:03,298 INFO L225 Difference]: With dead ends: 75529 [2025-01-08 22:50:03,298 INFO L226 Difference]: Without dead ends: 43271 [2025-01-08 22:50:03,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:50:03,325 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 64 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:03,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 222 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:50:03,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43271 states. [2025-01-08 22:50:04,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43271 to 43269. [2025-01-08 22:50:04,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43269 states, 43268 states have (on average 1.431889618193584) internal successors, (61955), 43268 states have internal predecessors, (61955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:04,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43269 states to 43269 states and 61955 transitions. [2025-01-08 22:50:04,127 INFO L78 Accepts]: Start accepts. Automaton has 43269 states and 61955 transitions. Word has length 31 [2025-01-08 22:50:04,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:04,127 INFO L471 AbstractCegarLoop]: Abstraction has 43269 states and 61955 transitions. [2025-01-08 22:50:04,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:04,128 INFO L276 IsEmpty]: Start isEmpty. Operand 43269 states and 61955 transitions. [2025-01-08 22:50:04,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-08 22:50:04,141 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:04,141 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] [2025-01-08 22:50:04,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-08 22:50:04,142 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:04,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:04,142 INFO L85 PathProgramCache]: Analyzing trace with hash 91187460, now seen corresponding path program 1 times [2025-01-08 22:50:04,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:04,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222546310] [2025-01-08 22:50:04,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:04,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:04,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-08 22:50:04,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-08 22:50:04,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:04,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:04,158 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-08 22:50:04,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:04,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222546310] [2025-01-08 22:50:04,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222546310] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:04,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:04,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:50:04,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158150607] [2025-01-08 22:50:04,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:04,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:50:04,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:04,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:50:04,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:50:04,159 INFO L87 Difference]: Start difference. First operand 43269 states and 61955 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:04,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:04,503 INFO L93 Difference]: Finished difference Result 65289 states and 93445 transitions. [2025-01-08 22:50:04,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:50:04,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2025-01-08 22:50:04,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:04,546 INFO L225 Difference]: With dead ends: 65289 [2025-01-08 22:50:04,546 INFO L226 Difference]: Without dead ends: 44039 [2025-01-08 22:50:04,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:50:04,561 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 66 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:04,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 204 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:50:04,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44039 states. [2025-01-08 22:50:04,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44039 to 44037. [2025-01-08 22:50:05,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44037 states, 44036 states have (on average 1.4185439186120448) internal successors, (62467), 44036 states have internal predecessors, (62467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:05,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44037 states to 44037 states and 62467 transitions. [2025-01-08 22:50:05,068 INFO L78 Accepts]: Start accepts. Automaton has 44037 states and 62467 transitions. Word has length 32 [2025-01-08 22:50:05,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:05,068 INFO L471 AbstractCegarLoop]: Abstraction has 44037 states and 62467 transitions. [2025-01-08 22:50:05,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:05,068 INFO L276 IsEmpty]: Start isEmpty. Operand 44037 states and 62467 transitions. [2025-01-08 22:50:05,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-08 22:50:05,168 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:05,168 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] [2025-01-08 22:50:05,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-08 22:50:05,168 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:05,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:05,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1597756282, now seen corresponding path program 1 times [2025-01-08 22:50:05,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:05,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247731393] [2025-01-08 22:50:05,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:05,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:05,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-08 22:50:05,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-08 22:50:05,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:05,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:05,191 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-08 22:50:05,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:05,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247731393] [2025-01-08 22:50:05,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247731393] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:05,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:05,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:50:05,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530178905] [2025-01-08 22:50:05,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:05,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:50:05,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:05,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:50:05,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:50:05,193 INFO L87 Difference]: Start difference. First operand 44037 states and 62467 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:05,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:05,592 INFO L93 Difference]: Finished difference Result 75785 states and 109573 transitions. [2025-01-08 22:50:05,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:50:05,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2025-01-08 22:50:05,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:05,672 INFO L225 Difference]: With dead ends: 75785 [2025-01-08 22:50:05,672 INFO L226 Difference]: Without dead ends: 75783 [2025-01-08 22:50:05,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:50:05,693 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 43 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:05,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 167 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:50:05,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75783 states. [2025-01-08 22:50:06,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75783 to 65541. [2025-01-08 22:50:06,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65541 states, 65540 states have (on average 1.374961855355508) internal successors, (90115), 65540 states have internal predecessors, (90115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:06,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65541 states to 65541 states and 90115 transitions. [2025-01-08 22:50:06,572 INFO L78 Accepts]: Start accepts. Automaton has 65541 states and 90115 transitions. Word has length 32 [2025-01-08 22:50:06,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:06,572 INFO L471 AbstractCegarLoop]: Abstraction has 65541 states and 90115 transitions. [2025-01-08 22:50:06,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:06,572 INFO L276 IsEmpty]: Start isEmpty. Operand 65541 states and 90115 transitions. [2025-01-08 22:50:06,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-08 22:50:06,594 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:06,595 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] [2025-01-08 22:50:06,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-08 22:50:06,595 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:06,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:06,596 INFO L85 PathProgramCache]: Analyzing trace with hash 703066308, now seen corresponding path program 1 times [2025-01-08 22:50:06,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:06,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737692796] [2025-01-08 22:50:06,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:06,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:06,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-08 22:50:06,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-08 22:50:06,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:06,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:06,613 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-08 22:50:06,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:06,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737692796] [2025-01-08 22:50:06,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737692796] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:06,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:06,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:50:06,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951738893] [2025-01-08 22:50:06,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:06,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:50:06,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:06,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:50:06,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:50:06,614 INFO L87 Difference]: Start difference. First operand 65541 states and 90115 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:07,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:07,514 INFO L93 Difference]: Finished difference Result 150537 states and 207877 transitions. [2025-01-08 22:50:07,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:50:07,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2025-01-08 22:50:07,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:07,601 INFO L225 Difference]: With dead ends: 150537 [2025-01-08 22:50:07,601 INFO L226 Difference]: Without dead ends: 86023 [2025-01-08 22:50:07,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:50:07,642 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 63 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:07,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 223 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:50:07,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86023 states. [2025-01-08 22:50:08,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86023 to 86021. [2025-01-08 22:50:08,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86021 states, 86020 states have (on average 1.3690188328295745) internal successors, (117763), 86020 states have internal predecessors, (117763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:08,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86021 states to 86021 states and 117763 transitions. [2025-01-08 22:50:08,972 INFO L78 Accepts]: Start accepts. Automaton has 86021 states and 117763 transitions. Word has length 32 [2025-01-08 22:50:08,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:08,972 INFO L471 AbstractCegarLoop]: Abstraction has 86021 states and 117763 transitions. [2025-01-08 22:50:08,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:08,972 INFO L276 IsEmpty]: Start isEmpty. Operand 86021 states and 117763 transitions. [2025-01-08 22:50:09,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-08 22:50:09,019 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:09,019 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] [2025-01-08 22:50:09,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-08 22:50:09,019 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:09,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:09,020 INFO L85 PathProgramCache]: Analyzing trace with hash 2009377943, now seen corresponding path program 1 times [2025-01-08 22:50:09,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:09,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321953181] [2025-01-08 22:50:09,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:09,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:09,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-08 22:50:09,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-08 22:50:09,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:09,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:09,037 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-08 22:50:09,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:09,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321953181] [2025-01-08 22:50:09,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321953181] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:09,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:09,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:50:09,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686879163] [2025-01-08 22:50:09,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:09,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:50:09,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:09,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:50:09,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:50:09,038 INFO L87 Difference]: Start difference. First operand 86021 states and 117763 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:09,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:09,938 INFO L93 Difference]: Finished difference Result 129033 states and 176133 transitions. [2025-01-08 22:50:09,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:50:09,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2025-01-08 22:50:09,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:10,018 INFO L225 Difference]: With dead ends: 129033 [2025-01-08 22:50:10,018 INFO L226 Difference]: Without dead ends: 87047 [2025-01-08 22:50:10,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:50:10,042 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 65 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:10,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 200 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:50:10,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87047 states. [2025-01-08 22:50:11,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87047 to 87045. [2025-01-08 22:50:11,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87045 states, 87044 states have (on average 1.3529134690501357) internal successors, (117763), 87044 states have internal predecessors, (117763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:11,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87045 states to 87045 states and 117763 transitions. [2025-01-08 22:50:11,913 INFO L78 Accepts]: Start accepts. Automaton has 87045 states and 117763 transitions. Word has length 33 [2025-01-08 22:50:11,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:11,914 INFO L471 AbstractCegarLoop]: Abstraction has 87045 states and 117763 transitions. [2025-01-08 22:50:11,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:11,915 INFO L276 IsEmpty]: Start isEmpty. Operand 87045 states and 117763 transitions. [2025-01-08 22:50:11,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-08 22:50:11,940 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:11,940 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] [2025-01-08 22:50:11,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-08 22:50:11,940 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:11,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:11,941 INFO L85 PathProgramCache]: Analyzing trace with hash 320434201, now seen corresponding path program 1 times [2025-01-08 22:50:11,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:11,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134748552] [2025-01-08 22:50:11,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:11,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:11,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-08 22:50:11,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-08 22:50:11,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:11,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:11,968 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-08 22:50:11,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:11,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134748552] [2025-01-08 22:50:11,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134748552] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:11,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:11,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:50:11,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688993180] [2025-01-08 22:50:11,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:11,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:50:11,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:11,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:50:11,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:50:11,970 INFO L87 Difference]: Start difference. First operand 87045 states and 117763 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:13,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:13,067 INFO L93 Difference]: Finished difference Result 147465 states and 202757 transitions. [2025-01-08 22:50:13,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:50:13,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2025-01-08 22:50:13,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:13,197 INFO L225 Difference]: With dead ends: 147465 [2025-01-08 22:50:13,198 INFO L226 Difference]: Without dead ends: 147463 [2025-01-08 22:50:13,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:50:13,218 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 40 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:13,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 165 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:50:13,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147463 states. [2025-01-08 22:50:15,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147463 to 131077. [2025-01-08 22:50:15,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131077 states, 131076 states have (on average 1.3124828343861576) internal successors, (172035), 131076 states have internal predecessors, (172035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:15,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131077 states to 131077 states and 172035 transitions. [2025-01-08 22:50:15,232 INFO L78 Accepts]: Start accepts. Automaton has 131077 states and 172035 transitions. Word has length 33 [2025-01-08 22:50:15,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:15,233 INFO L471 AbstractCegarLoop]: Abstraction has 131077 states and 172035 transitions. [2025-01-08 22:50:15,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:15,233 INFO L276 IsEmpty]: Start isEmpty. Operand 131077 states and 172035 transitions. [2025-01-08 22:50:15,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-08 22:50:15,276 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:15,276 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] [2025-01-08 22:50:15,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-08 22:50:15,276 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:15,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:15,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1673710505, now seen corresponding path program 1 times [2025-01-08 22:50:15,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:15,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953152650] [2025-01-08 22:50:15,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:15,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:15,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-08 22:50:15,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-08 22:50:15,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:15,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:15,297 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-08 22:50:15,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:15,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953152650] [2025-01-08 22:50:15,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953152650] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:15,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:15,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:50:15,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493419968] [2025-01-08 22:50:15,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:15,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:50:15,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:15,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:50:15,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:50:15,298 INFO L87 Difference]: Start difference. First operand 131077 states and 172035 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:17,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:17,356 INFO L93 Difference]: Finished difference Result 299017 states and 393221 transitions. [2025-01-08 22:50:17,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:50:17,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2025-01-08 22:50:17,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:17,690 INFO L225 Difference]: With dead ends: 299017 [2025-01-08 22:50:17,690 INFO L226 Difference]: Without dead ends: 169991 [2025-01-08 22:50:17,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:50:17,733 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 62 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:17,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 224 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:50:17,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169991 states. [2025-01-08 22:50:20,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169991 to 169989. [2025-01-08 22:50:20,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169989 states, 169988 states have (on average 1.3011918488363885) internal successors, (221187), 169988 states have internal predecessors, (221187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:20,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169989 states to 169989 states and 221187 transitions. [2025-01-08 22:50:20,664 INFO L78 Accepts]: Start accepts. Automaton has 169989 states and 221187 transitions. Word has length 33 [2025-01-08 22:50:20,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:50:20,665 INFO L471 AbstractCegarLoop]: Abstraction has 169989 states and 221187 transitions. [2025-01-08 22:50:20,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:20,665 INFO L276 IsEmpty]: Start isEmpty. Operand 169989 states and 221187 transitions. [2025-01-08 22:50:20,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-08 22:50:20,713 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:50:20,713 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] [2025-01-08 22:50:20,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-08 22:50:20,713 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:50:20,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:50:20,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1343741113, now seen corresponding path program 1 times [2025-01-08 22:50:20,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:50:20,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754322481] [2025-01-08 22:50:20,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:50:20,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:50:20,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-08 22:50:20,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-08 22:50:20,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:50:20,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:50:20,737 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-08 22:50:20,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:50:20,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754322481] [2025-01-08 22:50:20,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754322481] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:50:20,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:50:20,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:50:20,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443954106] [2025-01-08 22:50:20,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:50:20,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:50:20,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:50:20,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:50:20,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:50:20,737 INFO L87 Difference]: Start difference. First operand 169989 states and 221187 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:50:22,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:50:22,127 INFO L93 Difference]: Finished difference Result 254985 states and 330757 transitions. [2025-01-08 22:50:22,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:50:22,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2025-01-08 22:50:22,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:50:22,351 INFO L225 Difference]: With dead ends: 254985 [2025-01-08 22:50:22,351 INFO L226 Difference]: Without dead ends: 172039 [2025-01-08 22:50:22,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:50:22,409 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 64 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:50:22,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 196 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:50:22,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172039 states.