./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 78a4cc43ce1234c075e2c73cca2f6f44edddfccbee7278c746f2db07d17136bf --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 02:58:40,665 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:58:40,701 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 02:58:40,705 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:58:40,706 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:58:40,726 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:58:40,727 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:58:40,727 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:58:40,727 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:58:40,727 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:58:40,727 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:58:40,727 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:58:40,727 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:58:40,727 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:58:40,727 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:58:40,727 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:58:40,727 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:58:40,727 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:58:40,728 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 02:58:40,728 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:58:40,728 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:58:40,728 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:58:40,728 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:58:40,728 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:58:40,728 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:58:40,728 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:58:40,728 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:58:40,728 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:58:40,728 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:58:40,728 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:58:40,728 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:58:40,728 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:58:40,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:58:40,728 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:58:40,728 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:58:40,728 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:58:40,728 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:58:40,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:58:40,729 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:58:40,729 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:58:40,729 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:58:40,729 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:58:40,729 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 02:58:40,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 02:58:40,729 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:58:40,729 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:58:40,729 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:58:40,729 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:58:40,729 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 -> 78a4cc43ce1234c075e2c73cca2f6f44edddfccbee7278c746f2db07d17136bf [2025-01-09 02:58:40,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:58:40,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:58:40,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:58:40,954 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:58:40,954 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:58:40,955 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c [2025-01-09 02:58:41,554 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/05c2c6e38/1e265624539245bd9fcef5a745669219/FLAG9dfa028d6 [2025-01-09 02:58:43,287 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 02:58:43,288 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c [2025-01-09 02:58:43,299 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/05c2c6e38/1e265624539245bd9fcef5a745669219/FLAG9dfa028d6 [2025-01-09 02:58:43,314 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/05c2c6e38/1e265624539245bd9fcef5a745669219 [2025-01-09 02:58:43,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 02:58:43,317 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 02:58:43,319 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 02:58:43,319 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 02:58:43,323 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 02:58:43,328 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:58:43" (1/1) ... [2025-01-09 02:58:43,329 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b2282f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:43, skipping insertion in model container [2025-01-09 02:58:43,329 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:58:43" (1/1) ... [2025-01-09 02:58:43,367 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:58:43,512 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/loop-lit/gj2007.c.i.p+nlh-reducer.c[6448,6461] [2025-01-09 02:58:43,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:58:43,573 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 02:58:43,596 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/loop-lit/gj2007.c.i.p+nlh-reducer.c[6448,6461] [2025-01-09 02:58:43,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:58:43,621 INFO L204 MainTranslator]: Completed translation [2025-01-09 02:58:43,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:43 WrapperNode [2025-01-09 02:58:43,622 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 02:58:43,623 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 02:58:43,623 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 02:58:43,623 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 02:58:43,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:43" (1/1) ... [2025-01-09 02:58:43,640 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:43" (1/1) ... [2025-01-09 02:58:43,666 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 637 [2025-01-09 02:58:43,667 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 02:58:43,667 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 02:58:43,667 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 02:58:43,667 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 02:58:43,673 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:43" (1/1) ... [2025-01-09 02:58:43,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:43" (1/1) ... [2025-01-09 02:58:43,679 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:43" (1/1) ... [2025-01-09 02:58:43,696 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 02:58:43,696 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:43" (1/1) ... [2025-01-09 02:58:43,696 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:43" (1/1) ... [2025-01-09 02:58:43,700 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:43" (1/1) ... [2025-01-09 02:58:43,700 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:43" (1/1) ... [2025-01-09 02:58:43,704 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:43" (1/1) ... [2025-01-09 02:58:43,705 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:43" (1/1) ... [2025-01-09 02:58:43,706 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:43" (1/1) ... [2025-01-09 02:58:43,707 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 02:58:43,708 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 02:58:43,708 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 02:58:43,708 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 02:58:43,709 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:43" (1/1) ... [2025-01-09 02:58:43,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:58:43,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:58:43,732 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 02:58:43,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 02:58:43,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 02:58:43,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 02:58:43,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 02:58:43,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 02:58:43,793 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 02:58:43,794 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 02:58:44,177 INFO L? ?]: Removed 74 outVars from TransFormulas that were not future-live. [2025-01-09 02:58:44,177 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 02:58:44,185 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 02:58:44,185 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 02:58:44,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:58:44 BoogieIcfgContainer [2025-01-09 02:58:44,186 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 02:58:44,187 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 02:58:44,187 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 02:58:44,190 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 02:58:44,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:58:43" (1/3) ... [2025-01-09 02:58:44,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e80f9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:58:44, skipping insertion in model container [2025-01-09 02:58:44,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:43" (2/3) ... [2025-01-09 02:58:44,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e80f9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:58:44, skipping insertion in model container [2025-01-09 02:58:44,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:58:44" (3/3) ... [2025-01-09 02:58:44,192 INFO L128 eAbstractionObserver]: Analyzing ICFG gj2007.c.i.p+nlh-reducer.c [2025-01-09 02:58:44,201 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 02:58:44,203 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG gj2007.c.i.p+nlh-reducer.c that has 1 procedures, 144 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 02:58:44,237 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 02:58:44,244 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;@3cdaf49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 02:58:44,245 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 02:58:44,247 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 142 states have (on average 1.971830985915493) internal successors, (280), 143 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:44,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 02:58:44,254 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:44,254 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:58:44,254 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:58:44,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:44,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1067704148, now seen corresponding path program 1 times [2025-01-09 02:58:44,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:44,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741570667] [2025-01-09 02:58:44,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:44,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:44,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 02:58:44,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 02:58:44,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:44,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:44,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:58:44,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:44,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741570667] [2025-01-09 02:58:44,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741570667] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:58:44,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:58:44,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:58:44,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689285001] [2025-01-09 02:58:44,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:58:44,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:58:44,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:44,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:58:44,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:58:44,601 INFO L87 Difference]: Start difference. First operand has 144 states, 142 states have (on average 1.971830985915493) internal successors, (280), 143 states have internal predecessors, (280), 0 states have call successors, (0), 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 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:44,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:44,869 INFO L93 Difference]: Finished difference Result 284 states and 554 transitions. [2025-01-09 02:58:44,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:58:44,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-01-09 02:58:44,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:44,875 INFO L225 Difference]: With dead ends: 284 [2025-01-09 02:58:44,875 INFO L226 Difference]: Without dead ends: 141 [2025-01-09 02:58:44,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:58:44,879 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:44,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 280 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 02:58:44,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-01-09 02:58:44,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2025-01-09 02:58:44,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.4857142857142858) internal successors, (208), 140 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:44,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2025-01-09 02:58:44,902 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 139 [2025-01-09 02:58:44,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:44,902 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2025-01-09 02:58:44,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:44,903 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2025-01-09 02:58:44,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 02:58:44,904 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:44,904 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:58:44,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 02:58:44,904 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:58:44,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:44,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1752580255, now seen corresponding path program 1 times [2025-01-09 02:58:44,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:44,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447078056] [2025-01-09 02:58:44,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:44,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:44,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 02:58:44,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 02:58:44,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:44,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:45,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:58:45,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:45,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447078056] [2025-01-09 02:58:45,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447078056] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:58:45,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:58:45,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:58:45,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321789777] [2025-01-09 02:58:45,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:58:45,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:58:45,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:45,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:58:45,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:58:45,124 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:45,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:45,616 INFO L93 Difference]: Finished difference Result 406 states and 605 transitions. [2025-01-09 02:58:45,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:58:45,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-01-09 02:58:45,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:45,619 INFO L225 Difference]: With dead ends: 406 [2025-01-09 02:58:45,622 INFO L226 Difference]: Without dead ends: 273 [2025-01-09 02:58:45,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:58:45,623 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 65 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:45,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 82 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 02:58:45,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-01-09 02:58:45,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2025-01-09 02:58:45,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 272 states have (on average 1.2536764705882353) internal successors, (341), 272 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:45,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 341 transitions. [2025-01-09 02:58:45,648 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 341 transitions. Word has length 139 [2025-01-09 02:58:45,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:45,648 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 341 transitions. [2025-01-09 02:58:45,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:45,649 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 341 transitions. [2025-01-09 02:58:45,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 02:58:45,651 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:45,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:58:45,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 02:58:45,651 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:58:45,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:45,654 INFO L85 PathProgramCache]: Analyzing trace with hash 2041942551, now seen corresponding path program 1 times [2025-01-09 02:58:45,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:45,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509267342] [2025-01-09 02:58:45,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:45,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:45,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 02:58:45,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 02:58:45,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:45,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:45,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:58:45,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:45,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509267342] [2025-01-09 02:58:45,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509267342] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:58:45,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:58:45,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 02:58:45,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198055021] [2025-01-09 02:58:45,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:58:45,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 02:58:45,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:45,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 02:58:45,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 02:58:45,909 INFO L87 Difference]: Start difference. First operand 273 states and 341 transitions. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:46,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:46,107 INFO L93 Difference]: Finished difference Result 402 states and 470 transitions. [2025-01-09 02:58:46,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 02:58:46,109 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-01-09 02:58:46,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:46,110 INFO L225 Difference]: With dead ends: 402 [2025-01-09 02:58:46,112 INFO L226 Difference]: Without dead ends: 267 [2025-01-09 02:58:46,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 02:58:46,113 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:46,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 02:58:46,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-01-09 02:58:46,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2025-01-09 02:58:46,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 1.2481203007518797) internal successors, (332), 266 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:46,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 332 transitions. [2025-01-09 02:58:46,133 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 332 transitions. Word has length 139 [2025-01-09 02:58:46,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:46,133 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 332 transitions. [2025-01-09 02:58:46,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:46,134 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 332 transitions. [2025-01-09 02:58:46,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 02:58:46,136 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:46,137 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:58:46,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 02:58:46,137 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:58:46,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:46,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1527946145, now seen corresponding path program 1 times [2025-01-09 02:58:46,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:46,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570380159] [2025-01-09 02:58:46,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:46,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:46,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 02:58:46,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 02:58:46,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:46,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:46,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:58:46,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:46,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570380159] [2025-01-09 02:58:46,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570380159] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:58:46,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:58:46,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 02:58:46,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823478531] [2025-01-09 02:58:46,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:58:46,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 02:58:46,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:46,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 02:58:46,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:58:46,377 INFO L87 Difference]: Start difference. First operand 267 states and 332 transitions. Second operand has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:46,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:46,691 INFO L93 Difference]: Finished difference Result 394 states and 459 transitions. [2025-01-09 02:58:46,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 02:58:46,692 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-01-09 02:58:46,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:46,693 INFO L225 Difference]: With dead ends: 394 [2025-01-09 02:58:46,693 INFO L226 Difference]: Without dead ends: 265 [2025-01-09 02:58:46,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:58:46,695 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:46,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 203 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 02:58:46,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-01-09 02:58:46,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2025-01-09 02:58:46,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.246212121212121) internal successors, (329), 264 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:46,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 329 transitions. [2025-01-09 02:58:46,708 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 329 transitions. Word has length 139 [2025-01-09 02:58:46,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:46,708 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 329 transitions. [2025-01-09 02:58:46,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:46,708 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 329 transitions. [2025-01-09 02:58:46,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 02:58:46,709 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:46,710 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:58:46,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 02:58:46,710 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:58:46,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:46,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1089183555, now seen corresponding path program 1 times [2025-01-09 02:58:46,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:46,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434976808] [2025-01-09 02:58:46,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:46,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:46,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 02:58:46,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 02:58:46,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:46,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:46,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:58:46,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:46,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434976808] [2025-01-09 02:58:46,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434976808] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:58:46,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:58:46,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 02:58:46,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111802498] [2025-01-09 02:58:46,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:58:46,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 02:58:46,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:46,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 02:58:46,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-01-09 02:58:46,881 INFO L87 Difference]: Start difference. First operand 265 states and 329 transitions. Second operand has 10 states, 10 states have (on average 13.9) internal successors, (139), 10 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:47,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:47,173 INFO L93 Difference]: Finished difference Result 386 states and 450 transitions. [2025-01-09 02:58:47,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 02:58:47,177 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.9) internal successors, (139), 10 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-01-09 02:58:47,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:47,178 INFO L225 Difference]: With dead ends: 386 [2025-01-09 02:58:47,178 INFO L226 Difference]: Without dead ends: 259 [2025-01-09 02:58:47,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-01-09 02:58:47,179 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:47,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 191 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 02:58:47,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-01-09 02:58:47,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2025-01-09 02:58:47,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 258 states have (on average 1.2403100775193798) internal successors, (320), 258 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:47,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 320 transitions. [2025-01-09 02:58:47,197 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 320 transitions. Word has length 139 [2025-01-09 02:58:47,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:47,197 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 320 transitions. [2025-01-09 02:58:47,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.9) internal successors, (139), 10 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:47,197 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 320 transitions. [2025-01-09 02:58:47,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 02:58:47,199 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:47,199 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:58:47,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 02:58:47,200 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:58:47,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:47,200 INFO L85 PathProgramCache]: Analyzing trace with hash -41763050, now seen corresponding path program 1 times [2025-01-09 02:58:47,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:47,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114506068] [2025-01-09 02:58:47,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:47,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:47,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 02:58:47,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 02:58:47,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:47,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:47,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:58:47,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:47,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114506068] [2025-01-09 02:58:47,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114506068] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:58:47,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:58:47,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 02:58:47,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174798307] [2025-01-09 02:58:47,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:58:47,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 02:58:47,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:47,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 02:58:47,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 02:58:47,574 INFO L87 Difference]: Start difference. First operand 259 states and 320 transitions. Second operand has 13 states, 13 states have (on average 10.692307692307692) internal successors, (139), 13 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:47,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:47,873 INFO L93 Difference]: Finished difference Result 374 states and 435 transitions. [2025-01-09 02:58:47,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 02:58:47,873 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.692307692307692) internal successors, (139), 13 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-01-09 02:58:47,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:47,875 INFO L225 Difference]: With dead ends: 374 [2025-01-09 02:58:47,875 INFO L226 Difference]: Without dead ends: 253 [2025-01-09 02:58:47,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 02:58:47,876 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:47,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 02:58:47,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-01-09 02:58:47,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2025-01-09 02:58:47,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 1.2341269841269842) internal successors, (311), 252 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:47,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 311 transitions. [2025-01-09 02:58:47,886 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 311 transitions. Word has length 139 [2025-01-09 02:58:47,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:47,886 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 311 transitions. [2025-01-09 02:58:47,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.692307692307692) internal successors, (139), 13 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:47,887 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 311 transitions. [2025-01-09 02:58:47,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 02:58:47,888 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:47,888 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:58:47,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 02:58:47,888 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:58:47,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:47,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1153200357, now seen corresponding path program 1 times [2025-01-09 02:58:47,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:47,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160524489] [2025-01-09 02:58:47,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:47,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:47,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 02:58:47,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 02:58:47,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:47,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:48,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:58:48,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:48,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160524489] [2025-01-09 02:58:48,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160524489] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:58:48,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:58:48,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 02:58:48,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690556559] [2025-01-09 02:58:48,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:58:48,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 02:58:48,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:48,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 02:58:48,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2025-01-09 02:58:48,192 INFO L87 Difference]: Start difference. First operand 253 states and 311 transitions. Second operand has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 15 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:48,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:48,442 INFO L93 Difference]: Finished difference Result 364 states and 422 transitions. [2025-01-09 02:58:48,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 02:58:48,443 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 15 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-01-09 02:58:48,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:48,444 INFO L225 Difference]: With dead ends: 364 [2025-01-09 02:58:48,444 INFO L226 Difference]: Without dead ends: 249 [2025-01-09 02:58:48,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2025-01-09 02:58:48,445 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:48,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 02:58:48,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-01-09 02:58:48,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2025-01-09 02:58:48,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 1.2298387096774193) internal successors, (305), 248 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:48,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 305 transitions. [2025-01-09 02:58:48,451 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 305 transitions. Word has length 139 [2025-01-09 02:58:48,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:48,451 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 305 transitions. [2025-01-09 02:58:48,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 15 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:48,451 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 305 transitions. [2025-01-09 02:58:48,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 02:58:48,452 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:48,453 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:58:48,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 02:58:48,453 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:58:48,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:48,453 INFO L85 PathProgramCache]: Analyzing trace with hash -717830785, now seen corresponding path program 1 times [2025-01-09 02:58:48,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:48,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412646285] [2025-01-09 02:58:48,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:48,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:48,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 02:58:48,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 02:58:48,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:48,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:48,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:58:48,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:48,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412646285] [2025-01-09 02:58:48,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412646285] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:58:48,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:58:48,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-01-09 02:58:48,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793859429] [2025-01-09 02:58:48,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:58:48,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 02:58:48,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:48,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 02:58:48,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2025-01-09 02:58:48,815 INFO L87 Difference]: Start difference. First operand 249 states and 305 transitions. Second operand has 19 states, 19 states have (on average 7.315789473684211) internal successors, (139), 19 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:49,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:49,015 INFO L93 Difference]: Finished difference Result 352 states and 408 transitions. [2025-01-09 02:58:49,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 02:58:49,016 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.315789473684211) internal successors, (139), 19 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-01-09 02:58:49,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:49,017 INFO L225 Difference]: With dead ends: 352 [2025-01-09 02:58:49,017 INFO L226 Difference]: Without dead ends: 241 [2025-01-09 02:58:49,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2025-01-09 02:58:49,018 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:49,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 02:58:49,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-01-09 02:58:49,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2025-01-09 02:58:49,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 1.2208333333333334) internal successors, (293), 240 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:49,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 293 transitions. [2025-01-09 02:58:49,027 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 293 transitions. Word has length 139 [2025-01-09 02:58:49,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:49,027 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 293 transitions. [2025-01-09 02:58:49,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.315789473684211) internal successors, (139), 19 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:49,029 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 293 transitions. [2025-01-09 02:58:49,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 02:58:49,030 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:49,030 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:58:49,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 02:58:49,030 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:58:49,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:49,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1738769551, now seen corresponding path program 1 times [2025-01-09 02:58:49,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:49,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852462759] [2025-01-09 02:58:49,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:49,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:49,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 02:58:49,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 02:58:49,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:49,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:49,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:58:49,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:49,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852462759] [2025-01-09 02:58:49,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852462759] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:58:49,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:58:49,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-01-09 02:58:49,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755443532] [2025-01-09 02:58:49,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:58:49,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 02:58:49,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:49,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 02:58:49,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2025-01-09 02:58:49,458 INFO L87 Difference]: Start difference. First operand 241 states and 293 transitions. Second operand has 22 states, 22 states have (on average 6.318181818181818) internal successors, (139), 22 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:49,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:49,917 INFO L93 Difference]: Finished difference Result 338 states and 390 transitions. [2025-01-09 02:58:49,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 02:58:49,918 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.318181818181818) internal successors, (139), 22 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-01-09 02:58:49,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:49,920 INFO L225 Difference]: With dead ends: 338 [2025-01-09 02:58:49,920 INFO L226 Difference]: Without dead ends: 235 [2025-01-09 02:58:49,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2025-01-09 02:58:49,921 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:49,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 02:58:49,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-01-09 02:58:49,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2025-01-09 02:58:49,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 1.2136752136752136) internal successors, (284), 234 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:49,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 284 transitions. [2025-01-09 02:58:49,926 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 284 transitions. Word has length 139 [2025-01-09 02:58:49,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:49,926 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 284 transitions. [2025-01-09 02:58:49,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.318181818181818) internal successors, (139), 22 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:49,927 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 284 transitions. [2025-01-09 02:58:49,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 02:58:49,928 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:49,928 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:58:49,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 02:58:49,928 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:58:49,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:49,928 INFO L85 PathProgramCache]: Analyzing trace with hash -834827415, now seen corresponding path program 1 times [2025-01-09 02:58:49,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:49,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319835672] [2025-01-09 02:58:49,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:49,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:49,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 02:58:49,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 02:58:49,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:49,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:50,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:58:50,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:50,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319835672] [2025-01-09 02:58:50,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319835672] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:58:50,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:58:50,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-01-09 02:58:50,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830337779] [2025-01-09 02:58:50,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:58:50,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 02:58:50,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:50,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 02:58:50,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-01-09 02:58:50,341 INFO L87 Difference]: Start difference. First operand 235 states and 284 transitions. Second operand has 23 states, 23 states have (on average 6.043478260869565) internal successors, (139), 23 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:50,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:50,706 INFO L93 Difference]: Finished difference Result 330 states and 379 transitions. [2025-01-09 02:58:50,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 02:58:50,707 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.043478260869565) internal successors, (139), 23 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-01-09 02:58:50,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:50,707 INFO L225 Difference]: With dead ends: 330 [2025-01-09 02:58:50,708 INFO L226 Difference]: Without dead ends: 233 [2025-01-09 02:58:50,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-01-09 02:58:50,708 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:50,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 02:58:50,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-01-09 02:58:50,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2025-01-09 02:58:50,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 1.2112068965517242) internal successors, (281), 232 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:50,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 281 transitions. [2025-01-09 02:58:50,713 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 281 transitions. Word has length 139 [2025-01-09 02:58:50,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:50,713 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 281 transitions. [2025-01-09 02:58:50,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.043478260869565) internal successors, (139), 23 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:50,714 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 281 transitions. [2025-01-09 02:58:50,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 02:58:50,717 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:50,717 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:58:50,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 02:58:50,718 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:58:50,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:50,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1868941195, now seen corresponding path program 1 times [2025-01-09 02:58:50,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:50,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735608310] [2025-01-09 02:58:50,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:50,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:50,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 02:58:50,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 02:58:50,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:50,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:51,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:58:51,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:51,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735608310] [2025-01-09 02:58:51,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735608310] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:58:51,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:58:51,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2025-01-09 02:58:51,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672947145] [2025-01-09 02:58:51,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:58:51,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 02:58:51,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:51,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 02:58:51,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2025-01-09 02:58:51,073 INFO L87 Difference]: Start difference. First operand 233 states and 281 transitions. Second operand has 26 states, 26 states have (on average 5.346153846153846) internal successors, (139), 26 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:51,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:51,305 INFO L93 Difference]: Finished difference Result 322 states and 370 transitions. [2025-01-09 02:58:51,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 02:58:51,306 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.346153846153846) internal successors, (139), 26 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-01-09 02:58:51,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:51,307 INFO L225 Difference]: With dead ends: 322 [2025-01-09 02:58:51,307 INFO L226 Difference]: Without dead ends: 227 [2025-01-09 02:58:51,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2025-01-09 02:58:51,307 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:51,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 02:58:51,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-01-09 02:58:51,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2025-01-09 02:58:51,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.2035398230088497) internal successors, (272), 226 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:51,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 272 transitions. [2025-01-09 02:58:51,311 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 272 transitions. Word has length 139 [2025-01-09 02:58:51,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:51,314 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 272 transitions. [2025-01-09 02:58:51,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.346153846153846) internal successors, (139), 26 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:51,315 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 272 transitions. [2025-01-09 02:58:51,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 02:58:51,315 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:51,316 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:58:51,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 02:58:51,316 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:58:51,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:51,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1432066370, now seen corresponding path program 1 times [2025-01-09 02:58:51,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:51,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031056971] [2025-01-09 02:58:51,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:51,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:51,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 02:58:51,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 02:58:51,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:51,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:51,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:58:51,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:51,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031056971] [2025-01-09 02:58:51,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031056971] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:58:51,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:58:51,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2025-01-09 02:58:51,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215291562] [2025-01-09 02:58:51,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:58:51,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 02:58:51,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:51,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 02:58:51,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2025-01-09 02:58:51,708 INFO L87 Difference]: Start difference. First operand 227 states and 272 transitions. Second operand has 29 states, 29 states have (on average 4.793103448275862) internal successors, (139), 29 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:52,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:52,028 INFO L93 Difference]: Finished difference Result 310 states and 355 transitions. [2025-01-09 02:58:52,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-01-09 02:58:52,029 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 4.793103448275862) internal successors, (139), 29 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-01-09 02:58:52,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:52,029 INFO L225 Difference]: With dead ends: 310 [2025-01-09 02:58:52,030 INFO L226 Difference]: Without dead ends: 221 [2025-01-09 02:58:52,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2025-01-09 02:58:52,030 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:52,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 02:58:52,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-01-09 02:58:52,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2025-01-09 02:58:52,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.1954545454545455) internal successors, (263), 220 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:52,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 263 transitions. [2025-01-09 02:58:52,034 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 263 transitions. Word has length 139 [2025-01-09 02:58:52,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:52,034 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 263 transitions. [2025-01-09 02:58:52,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.793103448275862) internal successors, (139), 29 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:52,034 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 263 transitions. [2025-01-09 02:58:52,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 02:58:52,035 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:52,035 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:58:52,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 02:58:52,035 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:58:52,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:52,036 INFO L85 PathProgramCache]: Analyzing trace with hash -269817043, now seen corresponding path program 1 times [2025-01-09 02:58:52,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:52,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430178463] [2025-01-09 02:58:52,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:52,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:52,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 02:58:52,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 02:58:52,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:52,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:52,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:58:52,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:52,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430178463] [2025-01-09 02:58:52,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430178463] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:58:52,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:58:52,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2025-01-09 02:58:52,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596419671] [2025-01-09 02:58:52,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:58:52,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-09 02:58:52,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:52,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-09 02:58:52,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2025-01-09 02:58:52,484 INFO L87 Difference]: Start difference. First operand 221 states and 263 transitions. Second operand has 31 states, 31 states have (on average 4.483870967741935) internal successors, (139), 31 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:52,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:52,759 INFO L93 Difference]: Finished difference Result 300 states and 342 transitions. [2025-01-09 02:58:52,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-09 02:58:52,759 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 4.483870967741935) internal successors, (139), 31 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-01-09 02:58:52,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:52,760 INFO L225 Difference]: With dead ends: 300 [2025-01-09 02:58:52,760 INFO L226 Difference]: Without dead ends: 217 [2025-01-09 02:58:52,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2025-01-09 02:58:52,761 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:52,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 02:58:52,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-01-09 02:58:52,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2025-01-09 02:58:52,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.1898148148148149) internal successors, (257), 216 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:52,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 257 transitions. [2025-01-09 02:58:52,765 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 257 transitions. Word has length 139 [2025-01-09 02:58:52,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:52,765 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 257 transitions. [2025-01-09 02:58:52,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 4.483870967741935) internal successors, (139), 31 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:52,765 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 257 transitions. [2025-01-09 02:58:52,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 02:58:52,766 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:52,766 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:58:52,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 02:58:52,766 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:58:52,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:52,766 INFO L85 PathProgramCache]: Analyzing trace with hash -295254777, now seen corresponding path program 1 times [2025-01-09 02:58:52,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:52,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147470755] [2025-01-09 02:58:52,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:52,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:52,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 02:58:52,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 02:58:52,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:52,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:53,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-09 02:58:53,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:53,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147470755] [2025-01-09 02:58:53,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147470755] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:58:53,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:58:53,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2025-01-09 02:58:53,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526809254] [2025-01-09 02:58:53,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:58:53,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-09 02:58:53,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:53,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-09 02:58:53,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 02:58:53,335 INFO L87 Difference]: Start difference. First operand 217 states and 257 transitions. Second operand has 35 states, 35 states have (on average 3.9714285714285715) internal successors, (139), 35 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:53,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:53,539 INFO L93 Difference]: Finished difference Result 288 states and 328 transitions. [2025-01-09 02:58:53,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-01-09 02:58:53,540 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.9714285714285715) internal successors, (139), 35 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-01-09 02:58:53,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:53,540 INFO L225 Difference]: With dead ends: 288 [2025-01-09 02:58:53,540 INFO L226 Difference]: Without dead ends: 209 [2025-01-09 02:58:53,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 02:58:53,541 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:53,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 02:58:53,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-01-09 02:58:53,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2025-01-09 02:58:53,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.1778846153846154) internal successors, (245), 208 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:53,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 245 transitions. [2025-01-09 02:58:53,545 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 245 transitions. Word has length 139 [2025-01-09 02:58:53,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:53,545 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 245 transitions. [2025-01-09 02:58:53,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.9714285714285715) internal successors, (139), 35 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:53,545 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 245 transitions. [2025-01-09 02:58:53,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 02:58:53,546 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:53,546 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:58:53,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 02:58:53,546 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:58:53,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:53,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1471149049, now seen corresponding path program 1 times [2025-01-09 02:58:53,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:53,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588837249] [2025-01-09 02:58:53,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:53,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:53,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 02:58:53,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 02:58:53,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:53,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:54,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:58:54,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:54,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588837249] [2025-01-09 02:58:54,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588837249] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:58:54,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:58:54,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2025-01-09 02:58:54,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756046745] [2025-01-09 02:58:54,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:58:54,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-01-09 02:58:54,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:54,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-01-09 02:58:54,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2025-01-09 02:58:54,483 INFO L87 Difference]: Start difference. First operand 209 states and 245 transitions. Second operand has 38 states, 38 states have (on average 3.6578947368421053) internal successors, (139), 38 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:54,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:54,809 INFO L93 Difference]: Finished difference Result 274 states and 310 transitions. [2025-01-09 02:58:54,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-01-09 02:58:54,809 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.6578947368421053) internal successors, (139), 38 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-01-09 02:58:54,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:54,810 INFO L225 Difference]: With dead ends: 274 [2025-01-09 02:58:54,810 INFO L226 Difference]: Without dead ends: 203 [2025-01-09 02:58:54,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2025-01-09 02:58:54,812 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:54,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 02:58:54,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-01-09 02:58:54,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2025-01-09 02:58:54,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 202 states have (on average 1.1683168316831682) internal successors, (236), 202 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:54,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 236 transitions. [2025-01-09 02:58:54,819 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 236 transitions. Word has length 139 [2025-01-09 02:58:54,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:54,819 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 236 transitions. [2025-01-09 02:58:54,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.6578947368421053) internal successors, (139), 38 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:54,820 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 236 transitions. [2025-01-09 02:58:54,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 02:58:54,820 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:54,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:58:54,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 02:58:54,820 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:58:54,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:54,821 INFO L85 PathProgramCache]: Analyzing trace with hash -2129031119, now seen corresponding path program 1 times [2025-01-09 02:58:54,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:54,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464569775] [2025-01-09 02:58:54,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:54,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:54,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 02:58:54,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 02:58:54,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:54,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:55,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:58:55,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:55,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464569775] [2025-01-09 02:58:55,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464569775] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:58:55,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:58:55,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2025-01-09 02:58:55,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292615571] [2025-01-09 02:58:55,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:58:55,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-01-09 02:58:55,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:55,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-01-09 02:58:55,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 02:58:55,479 INFO L87 Difference]: Start difference. First operand 203 states and 236 transitions. Second operand has 39 states, 39 states have (on average 3.5641025641025643) internal successors, (139), 39 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:55,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:55,756 INFO L93 Difference]: Finished difference Result 266 states and 299 transitions. [2025-01-09 02:58:55,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-01-09 02:58:55,756 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.5641025641025643) internal successors, (139), 39 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-01-09 02:58:55,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:55,757 INFO L225 Difference]: With dead ends: 266 [2025-01-09 02:58:55,757 INFO L226 Difference]: Without dead ends: 201 [2025-01-09 02:58:55,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 02:58:55,758 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:55,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 02:58:55,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-01-09 02:58:55,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2025-01-09 02:58:55,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 1.165) internal successors, (233), 200 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:55,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 233 transitions. [2025-01-09 02:58:55,762 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 233 transitions. Word has length 139 [2025-01-09 02:58:55,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:55,762 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 233 transitions. [2025-01-09 02:58:55,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.5641025641025643) internal successors, (139), 39 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:55,762 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 233 transitions. [2025-01-09 02:58:55,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 02:58:55,763 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:55,763 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:58:55,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 02:58:55,763 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:58:55,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:55,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1672960723, now seen corresponding path program 1 times [2025-01-09 02:58:55,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:55,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687114896] [2025-01-09 02:58:55,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:55,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:55,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 02:58:55,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 02:58:55,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:55,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:56,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:58:56,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:56,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687114896] [2025-01-09 02:58:56,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687114896] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:58:56,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:58:56,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2025-01-09 02:58:56,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959261236] [2025-01-09 02:58:56,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:58:56,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-01-09 02:58:56,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:56,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-01-09 02:58:56,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 02:58:56,578 INFO L87 Difference]: Start difference. First operand 201 states and 233 transitions. Second operand has 42 states, 42 states have (on average 3.3095238095238093) internal successors, (139), 42 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:56,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:56,911 INFO L93 Difference]: Finished difference Result 258 states and 290 transitions. [2025-01-09 02:58:56,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-01-09 02:58:56,911 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.3095238095238093) internal successors, (139), 42 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-01-09 02:58:56,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:56,912 INFO L225 Difference]: With dead ends: 258 [2025-01-09 02:58:56,912 INFO L226 Difference]: Without dead ends: 195 [2025-01-09 02:58:56,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 02:58:56,913 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:56,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 02:58:56,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-01-09 02:58:56,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2025-01-09 02:58:56,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 1.1546391752577319) internal successors, (224), 194 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:56,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 224 transitions. [2025-01-09 02:58:56,916 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 224 transitions. Word has length 139 [2025-01-09 02:58:56,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:56,916 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 224 transitions. [2025-01-09 02:58:56,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.3095238095238093) internal successors, (139), 42 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:56,917 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 224 transitions. [2025-01-09 02:58:56,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 02:58:56,917 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:56,917 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:58:56,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 02:58:56,918 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:58:56,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:56,918 INFO L85 PathProgramCache]: Analyzing trace with hash -371842202, now seen corresponding path program 1 times [2025-01-09 02:58:56,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:56,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446124313] [2025-01-09 02:58:56,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:56,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:56,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 02:58:56,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 02:58:56,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:56,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:57,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:58:57,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:57,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446124313] [2025-01-09 02:58:57,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446124313] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:58:57,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:58:57,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2025-01-09 02:58:57,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196111428] [2025-01-09 02:58:57,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:58:57,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-01-09 02:58:57,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:57,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-01-09 02:58:57,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2025-01-09 02:58:57,745 INFO L87 Difference]: Start difference. First operand 195 states and 224 transitions. Second operand has 45 states, 45 states have (on average 3.088888888888889) internal successors, (139), 45 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:58,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:58,080 INFO L93 Difference]: Finished difference Result 246 states and 275 transitions. [2025-01-09 02:58:58,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-01-09 02:58:58,081 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.088888888888889) internal successors, (139), 45 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-01-09 02:58:58,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:58,081 INFO L225 Difference]: With dead ends: 246 [2025-01-09 02:58:58,081 INFO L226 Difference]: Without dead ends: 189 [2025-01-09 02:58:58,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2025-01-09 02:58:58,083 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:58,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 02:58:58,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-01-09 02:58:58,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2025-01-09 02:58:58,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 1.1436170212765957) internal successors, (215), 188 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:58,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 215 transitions. [2025-01-09 02:58:58,085 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 215 transitions. Word has length 139 [2025-01-09 02:58:58,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:58,085 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 215 transitions. [2025-01-09 02:58:58,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.088888888888889) internal successors, (139), 45 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:58,086 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 215 transitions. [2025-01-09 02:58:58,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 02:58:58,086 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:58,086 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:58:58,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 02:58:58,086 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:58:58,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:58,087 INFO L85 PathProgramCache]: Analyzing trace with hash 941521525, now seen corresponding path program 1 times [2025-01-09 02:58:58,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:58,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977963284] [2025-01-09 02:58:58,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:58,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:58,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 02:58:58,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 02:58:58,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:58,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:59,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:58:59,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:59,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977963284] [2025-01-09 02:58:59,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977963284] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:58:59,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:58:59,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2025-01-09 02:58:59,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926999348] [2025-01-09 02:58:59,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:58:59,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-01-09 02:58:59,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:59,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-01-09 02:58:59,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2025-01-09 02:58:59,068 INFO L87 Difference]: Start difference. First operand 189 states and 215 transitions. Second operand has 47 states, 47 states have (on average 2.9574468085106385) internal successors, (139), 47 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:59,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:59,357 INFO L93 Difference]: Finished difference Result 236 states and 262 transitions. [2025-01-09 02:58:59,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-01-09 02:58:59,357 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.9574468085106385) internal successors, (139), 47 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-01-09 02:58:59,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:59,358 INFO L225 Difference]: With dead ends: 236 [2025-01-09 02:58:59,358 INFO L226 Difference]: Without dead ends: 185 [2025-01-09 02:58:59,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2025-01-09 02:58:59,359 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:59,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 02:58:59,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-01-09 02:58:59,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2025-01-09 02:58:59,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.1358695652173914) internal successors, (209), 184 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:59,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 209 transitions. [2025-01-09 02:58:59,361 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 209 transitions. Word has length 139 [2025-01-09 02:58:59,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:59,362 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 209 transitions. [2025-01-09 02:58:59,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.9574468085106385) internal successors, (139), 47 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:59,362 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 209 transitions. [2025-01-09 02:58:59,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 02:58:59,362 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:59,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:58:59,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 02:58:59,363 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:58:59,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:59,363 INFO L85 PathProgramCache]: Analyzing trace with hash 566614415, now seen corresponding path program 1 times [2025-01-09 02:58:59,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:59,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970248397] [2025-01-09 02:58:59,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:59,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:59,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 02:58:59,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 02:58:59,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:59,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:59:00,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:59:00,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:59:00,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970248397] [2025-01-09 02:59:00,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970248397] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:59:00,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:59:00,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2025-01-09 02:59:00,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309147202] [2025-01-09 02:59:00,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:59:00,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-01-09 02:59:00,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:59:00,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-01-09 02:59:00,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2025-01-09 02:59:00,340 INFO L87 Difference]: Start difference. First operand 185 states and 209 transitions. Second operand has 51 states, 51 states have (on average 2.7254901960784315) internal successors, (139), 51 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:59:00,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:59:00,578 INFO L93 Difference]: Finished difference Result 224 states and 248 transitions. [2025-01-09 02:59:00,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-01-09 02:59:00,578 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.7254901960784315) internal successors, (139), 51 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-01-09 02:59:00,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:59:00,579 INFO L225 Difference]: With dead ends: 224 [2025-01-09 02:59:00,579 INFO L226 Difference]: Without dead ends: 177 [2025-01-09 02:59:00,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2025-01-09 02:59:00,580 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 02:59:00,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 02:59:00,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-01-09 02:59:00,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2025-01-09 02:59:00,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 1.1193181818181819) internal successors, (197), 176 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:59:00,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 197 transitions. [2025-01-09 02:59:00,586 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 197 transitions. Word has length 139 [2025-01-09 02:59:00,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:59:00,586 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 197 transitions. [2025-01-09 02:59:00,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.7254901960784315) internal successors, (139), 51 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:59:00,586 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 197 transitions. [2025-01-09 02:59:00,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 02:59:00,587 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:59:00,587 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:59:00,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 02:59:00,587 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:59:00,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:59:00,587 INFO L85 PathProgramCache]: Analyzing trace with hash 325265535, now seen corresponding path program 1 times [2025-01-09 02:59:00,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:59:00,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231916587] [2025-01-09 02:59:00,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:59:00,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:59:00,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 02:59:00,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 02:59:00,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:59:00,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:59:01,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:59:01,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:59:01,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231916587] [2025-01-09 02:59:01,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231916587] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:59:01,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:59:01,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2025-01-09 02:59:01,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175459281] [2025-01-09 02:59:01,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:59:01,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-01-09 02:59:01,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:59:01,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-01-09 02:59:01,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1328, Invalid=1428, Unknown=0, NotChecked=0, Total=2756 [2025-01-09 02:59:01,558 INFO L87 Difference]: Start difference. First operand 177 states and 197 transitions. Second operand has 53 states, 53 states have (on average 2.6226415094339623) internal successors, (139), 53 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:59:01,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:59:01,820 INFO L93 Difference]: Finished difference Result 212 states and 232 transitions. [2025-01-09 02:59:01,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-01-09 02:59:01,824 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.6226415094339623) internal successors, (139), 53 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-01-09 02:59:01,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:59:01,824 INFO L225 Difference]: With dead ends: 212 [2025-01-09 02:59:01,824 INFO L226 Difference]: Without dead ends: 143 [2025-01-09 02:59:01,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1328, Invalid=1428, Unknown=0, NotChecked=0, Total=2756 [2025-01-09 02:59:01,826 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 102 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 02:59:01,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 25 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 02:59:01,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-01-09 02:59:01,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2025-01-09 02:59:01,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.0142857142857142) internal successors, (142), 140 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:59:01,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2025-01-09 02:59:01,829 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 139 [2025-01-09 02:59:01,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:59:01,830 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2025-01-09 02:59:01,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.6226415094339623) internal successors, (139), 53 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:59:01,830 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2025-01-09 02:59:01,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 02:59:01,831 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:59:01,831 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:59:01,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 02:59:01,831 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:59:01,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:59:01,831 INFO L85 PathProgramCache]: Analyzing trace with hash -2012640870, now seen corresponding path program 1 times [2025-01-09 02:59:01,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:59:01,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503778918] [2025-01-09 02:59:01,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:59:01,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:59:01,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 02:59:01,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 02:59:01,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:59:01,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:59:03,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:59:03,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:59:03,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503778918] [2025-01-09 02:59:03,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503778918] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:59:03,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:59:03,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [70] imperfect sequences [] total 70 [2025-01-09 02:59:03,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801161774] [2025-01-09 02:59:03,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:59:03,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2025-01-09 02:59:03,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:59:03,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2025-01-09 02:59:03,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2025-01-09 02:59:03,578 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand has 70 states, 70 states have (on average 1.9857142857142858) internal successors, (139), 70 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:59:03,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:59:03,819 INFO L93 Difference]: Finished difference Result 182 states and 184 transitions. [2025-01-09 02:59:03,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-01-09 02:59:03,820 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 1.9857142857142858) internal successors, (139), 70 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-01-09 02:59:03,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:59:03,821 INFO L225 Difference]: With dead ends: 182 [2025-01-09 02:59:03,821 INFO L226 Difference]: Without dead ends: 143 [2025-01-09 02:59:03,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2025-01-09 02:59:03,824 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 1 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 02:59:03,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 20 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 02:59:03,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-01-09 02:59:03,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2025-01-09 02:59:03,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.0070921985815602) internal successors, (142), 141 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:59:03,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2025-01-09 02:59:03,826 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 139 [2025-01-09 02:59:03,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:59:03,827 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2025-01-09 02:59:03,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 1.9857142857142858) internal successors, (139), 70 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:59:03,827 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2025-01-09 02:59:03,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 02:59:03,827 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:59:03,828 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:59:03,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 02:59:03,828 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:59:03,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:59:03,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1420118316, now seen corresponding path program 1 times [2025-01-09 02:59:03,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:59:03,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460022899] [2025-01-09 02:59:03,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:59:03,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:59:03,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 02:59:03,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 02:59:03,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:59:03,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:59:05,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:59:05,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:59:05,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460022899] [2025-01-09 02:59:05,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460022899] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:59:05,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701087338] [2025-01-09 02:59:05,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:59:05,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:59:05,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:59:05,485 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:59:05,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 02:59:05,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 02:59:05,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 02:59:05,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:59:05,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:59:05,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-01-09 02:59:05,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:59:05,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:59:05,765 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:59:08,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:59:08,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701087338] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:59:08,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:59:08,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 103 [2025-01-09 02:59:08,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116247730] [2025-01-09 02:59:08,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:59:08,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2025-01-09 02:59:08,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:59:08,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2025-01-09 02:59:08,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2025-01-09 02:59:08,904 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand has 103 states, 103 states have (on average 2.737864077669903) internal successors, (282), 103 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:59:09,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:59:09,238 INFO L93 Difference]: Finished difference Result 209 states and 240 transitions. [2025-01-09 02:59:09,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2025-01-09 02:59:09,238 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 2.737864077669903) internal successors, (282), 103 states have internal predecessors, (282), 0 states have call successors, (0), 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 141 [2025-01-09 02:59:09,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:59:09,239 INFO L225 Difference]: With dead ends: 209 [2025-01-09 02:59:09,239 INFO L226 Difference]: Without dead ends: 206 [2025-01-09 02:59:09,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 212 SyntacticMatches, 38 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2153 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2025-01-09 02:59:09,242 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 84 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 02:59:09,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 32 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 02:59:09,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-01-09 02:59:09,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2025-01-09 02:59:09,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.0048780487804878) internal successors, (206), 205 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:59:09,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2025-01-09 02:59:09,245 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 141 [2025-01-09 02:59:09,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:59:09,245 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2025-01-09 02:59:09,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 2.737864077669903) internal successors, (282), 103 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:59:09,245 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2025-01-09 02:59:09,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-09 02:59:09,246 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:59:09,246 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:59:09,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 02:59:09,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-01-09 02:59:09,447 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:59:09,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:59:09,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1334769172, now seen corresponding path program 2 times [2025-01-09 02:59:09,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:59:09,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061136458] [2025-01-09 02:59:09,448 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:59:09,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:59:09,455 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 205 statements into 2 equivalence classes. [2025-01-09 02:59:09,485 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 02:59:09,485 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:59:09,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:59:10,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:59:10,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:59:10,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061136458] [2025-01-09 02:59:10,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061136458] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:59:10,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108433804] [2025-01-09 02:59:10,748 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:59:10,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:59:10,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:59:10,750 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:59:10,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 02:59:10,786 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 205 statements into 2 equivalence classes. [2025-01-09 02:59:10,835 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 02:59:10,835 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:59:10,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:59:10,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 105 conjuncts are in the unsatisfiable core [2025-01-09 02:59:10,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:59:11,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:59:11,049 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:59:11,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:59:11,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108433804] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:59:11,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:59:11,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 55 [2025-01-09 02:59:11,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172014452] [2025-01-09 02:59:11,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:59:11,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-01-09 02:59:11,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:59:11,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-01-09 02:59:11,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=2862, Unknown=0, NotChecked=0, Total=2970 [2025-01-09 02:59:11,262 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand has 55 states, 55 states have (on average 3.7636363636363637) internal successors, (207), 55 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:59:12,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:59:12,097 INFO L93 Difference]: Finished difference Result 212 states and 212 transitions. [2025-01-09 02:59:12,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-01-09 02:59:12,098 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 3.7636363636363637) internal successors, (207), 55 states have internal predecessors, (207), 0 states have call successors, (0), 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 205 [2025-01-09 02:59:12,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:59:12,098 INFO L225 Difference]: With dead ends: 212 [2025-01-09 02:59:12,099 INFO L226 Difference]: Without dead ends: 209 [2025-01-09 02:59:12,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 408 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=108, Invalid=2862, Unknown=0, NotChecked=0, Total=2970 [2025-01-09 02:59:12,099 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 1 mSDsluCounter, 8009 mSDsCounter, 0 mSdLazyCounter, 2812 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 8164 SdHoareTripleChecker+Invalid, 2812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 02:59:12,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 8164 Invalid, 2812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2812 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 02:59:12,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-01-09 02:59:12,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2025-01-09 02:59:12,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.0048309178743962) internal successors, (208), 207 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:59:12,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2025-01-09 02:59:12,102 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 205 [2025-01-09 02:59:12,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:59:12,102 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2025-01-09 02:59:12,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 3.7636363636363637) internal successors, (207), 55 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:59:12,102 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2025-01-09 02:59:12,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-01-09 02:59:12,103 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:59:12,103 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:59:12,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 02:59:12,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:59:12,307 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:59:12,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:59:12,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1489572658, now seen corresponding path program 3 times [2025-01-09 02:59:12,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:59:12,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748254871] [2025-01-09 02:59:12,307 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 02:59:12,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:59:12,315 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 207 statements into 35 equivalence classes. [2025-01-09 02:59:12,338 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) and asserted 207 of 207 statements. [2025-01-09 02:59:12,338 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2025-01-09 02:59:12,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:59:13,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 1156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:59:13,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:59:13,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748254871] [2025-01-09 02:59:13,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748254871] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:59:13,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:59:13,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2025-01-09 02:59:13,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51134238] [2025-01-09 02:59:13,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:59:13,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-01-09 02:59:13,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:59:13,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-01-09 02:59:13,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2025-01-09 02:59:13,599 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand has 52 states, 52 states have (on average 3.980769230769231) internal successors, (207), 52 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:59:13,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:59:13,958 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2025-01-09 02:59:13,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-01-09 02:59:13,958 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.980769230769231) internal successors, (207), 52 states have internal predecessors, (207), 0 states have call successors, (0), 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 207 [2025-01-09 02:59:13,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:59:13,959 INFO L225 Difference]: With dead ends: 208 [2025-01-09 02:59:13,959 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 02:59:13,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2025-01-09 02:59:13,961 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 02:59:13,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 02:59:13,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 02:59:13,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 02:59:13,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:59:13,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 02:59:13,962 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2025-01-09 02:59:13,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:59:13,962 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 02:59:13,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.980769230769231) internal successors, (207), 52 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:59:13,963 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 02:59:13,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 02:59:13,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 02:59:13,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 02:59:13,968 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:59:13,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 02:59:13,973 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 02:59:13,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:59:13 BoogieIcfgContainer [2025-01-09 02:59:13,979 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 02:59:13,979 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 02:59:13,979 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 02:59:13,979 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 02:59:13,980 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:58:44" (3/4) ... [2025-01-09 02:59:13,981 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 02:59:13,994 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-01-09 02:59:13,996 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 02:59:13,996 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 02:59:13,996 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 02:59:14,075 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 02:59:14,076 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 02:59:14,076 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 02:59:14,077 INFO L158 Benchmark]: Toolchain (without parser) took 30759.29ms. Allocated memory was 167.8MB in the beginning and 687.9MB in the end (delta: 520.1MB). Free memory was 124.2MB in the beginning and 583.2MB in the end (delta: -459.0MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. [2025-01-09 02:59:14,077 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:59:14,078 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.55ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 106.2MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 02:59:14,078 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.13ms. Allocated memory is still 167.8MB. Free memory was 105.7MB in the beginning and 103.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:59:14,078 INFO L158 Benchmark]: Boogie Preprocessor took 40.35ms. Allocated memory is still 167.8MB. Free memory was 103.1MB in the beginning and 100.3MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 02:59:14,078 INFO L158 Benchmark]: RCFGBuilder took 477.79ms. Allocated memory is still 167.8MB. Free memory was 100.3MB in the beginning and 56.3MB in the end (delta: 44.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-09 02:59:14,078 INFO L158 Benchmark]: TraceAbstraction took 29791.65ms. Allocated memory was 167.8MB in the beginning and 687.9MB in the end (delta: 520.1MB). Free memory was 55.8MB in the beginning and 591.6MB in the end (delta: -535.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:59:14,078 INFO L158 Benchmark]: Witness Printer took 96.58ms. Allocated memory is still 687.9MB. Free memory was 591.6MB in the beginning and 583.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 02:59:14,079 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 303.55ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 106.2MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.13ms. Allocated memory is still 167.8MB. Free memory was 105.7MB in the beginning and 103.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.35ms. Allocated memory is still 167.8MB. Free memory was 103.1MB in the beginning and 100.3MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 477.79ms. Allocated memory is still 167.8MB. Free memory was 100.3MB in the beginning and 56.3MB in the end (delta: 44.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 29791.65ms. Allocated memory was 167.8MB in the beginning and 687.9MB in the end (delta: 520.1MB). Free memory was 55.8MB in the beginning and 591.6MB in the end (delta: -535.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 96.58ms. Allocated memory is still 687.9MB. Free memory was 591.6MB in the beginning and 583.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 444]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 144 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.7s, OverallIterations: 25, TraceHistogramMax: 34, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 253 SdHoareTripleChecker+Valid, 7.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 253 mSDsluCounter, 11296 SdHoareTripleChecker+Invalid, 6.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8293 mSDsCounter, 421 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18338 IncrementalHoareTripleChecker+Invalid, 18759 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 421 mSolverCounterUnsat, 3003 mSDtfsCounter, 18338 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1492 GetRequests, 666 SyntacticMatches, 39 SemanticMatches, 787 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2153 ImplicationChecksByTransitivity, 13.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=273occurred in iteration=2, InterpolantAutomatonStates: 835, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 20.0s InterpolantComputationTime, 3957 NumberOfCodeBlocks, 3957 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 4274 ConstructedInterpolants, 0 QuantifiedInterpolants, 8837 SizeOfPredicates, 0 NumberOfNonLiveVariables, 882 ConjunctsInSsa, 175 ConjunctsInUnsatCore, 29 InterpolantComputations, 23 PerfectInterpolantSequences, 1156/4426 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 02:59:14,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE