./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label21.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/eca-rers2012/Problem12_label21.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 cf1785c72f46b71ff38ed18504aab74c5c60cda53bca8d196fb5a21f47b63a1c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:45:36,023 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:45:36,097 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:45:36,103 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:45:36,103 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:45:36,123 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:45:36,123 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:45:36,124 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:45:36,124 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:45:36,124 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:45:36,124 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:45:36,124 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:45:36,124 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:45:36,124 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:45:36,124 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:45:36,125 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:45:36,125 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:45:36,125 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:45:36,125 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:45:36,125 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:45:36,125 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:45:36,125 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:45:36,125 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:45:36,126 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:45:36,126 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:45:36,126 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:45:36,126 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:45:36,126 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:45:36,126 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:45:36,126 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:45:36,126 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:45:36,126 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:45:36,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:45:36,126 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:45:36,126 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:45:36,126 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:45:36,126 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:45:36,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:45:36,127 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:45:36,127 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:45:36,127 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:45:36,127 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:45:36,127 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:45:36,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:45:36,127 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:45:36,127 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:45:36,127 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:45:36,127 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:45:36,127 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 -> cf1785c72f46b71ff38ed18504aab74c5c60cda53bca8d196fb5a21f47b63a1c [2025-01-08 23:45:36,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:45:36,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:45:36,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:45:36,453 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:45:36,453 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:45:36,455 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label21.c [2025-01-08 23:45:37,745 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7e5a4432f/59e388ff8f2e4272a4a2b9154ce0b0f5/FLAGd3d456893 [2025-01-08 23:45:38,249 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:45:38,250 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label21.c [2025-01-08 23:45:38,283 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7e5a4432f/59e388ff8f2e4272a4a2b9154ce0b0f5/FLAGd3d456893 [2025-01-08 23:45:38,327 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7e5a4432f/59e388ff8f2e4272a4a2b9154ce0b0f5 [2025-01-08 23:45:38,331 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:45:38,332 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:45:38,334 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:45:38,334 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:45:38,337 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:45:38,338 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:45:38" (1/1) ... [2025-01-08 23:45:38,339 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15602bcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:38, skipping insertion in model container [2025-01-08 23:45:38,340 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:45:38" (1/1) ... [2025-01-08 23:45:38,458 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:45:38,660 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/eca-rers2012/Problem12_label21.c[3054,3067] [2025-01-08 23:45:39,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:45:39,266 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:45:39,287 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/eca-rers2012/Problem12_label21.c[3054,3067] [2025-01-08 23:45:39,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:45:39,644 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:45:39,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:39 WrapperNode [2025-01-08 23:45:39,647 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:45:39,648 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:45:39,648 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:45:39,648 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:45:39,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:39" (1/1) ... [2025-01-08 23:45:39,702 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:39" (1/1) ... [2025-01-08 23:45:39,980 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-01-08 23:45:39,980 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:45:39,981 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:45:39,981 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:45:39,981 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:45:39,989 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:39" (1/1) ... [2025-01-08 23:45:39,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:39" (1/1) ... [2025-01-08 23:45:40,089 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:39" (1/1) ... [2025-01-08 23:45:40,219 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-08 23:45:40,219 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:39" (1/1) ... [2025-01-08 23:45:40,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:39" (1/1) ... [2025-01-08 23:45:40,389 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:39" (1/1) ... [2025-01-08 23:45:40,425 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:39" (1/1) ... [2025-01-08 23:45:40,454 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:39" (1/1) ... [2025-01-08 23:45:40,500 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:39" (1/1) ... [2025-01-08 23:45:40,520 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:39" (1/1) ... [2025-01-08 23:45:40,574 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:45:40,576 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:45:40,577 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:45:40,577 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:45:40,578 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:39" (1/1) ... [2025-01-08 23:45:40,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:45:40,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:45:40,612 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 23:45:40,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 23:45:40,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:45:40,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:45:40,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:45:40,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:45:40,705 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:45:40,706 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:45:45,143 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-01-08 23:45:45,143 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:45:45,188 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:45:45,188 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:45:45,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:45:45 BoogieIcfgContainer [2025-01-08 23:45:45,189 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:45:45,192 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:45:45,192 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:45:45,200 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:45:45,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:45:38" (1/3) ... [2025-01-08 23:45:45,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@546cfb70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:45:45, skipping insertion in model container [2025-01-08 23:45:45,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:45:39" (2/3) ... [2025-01-08 23:45:45,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@546cfb70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:45:45, skipping insertion in model container [2025-01-08 23:45:45,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:45:45" (3/3) ... [2025-01-08 23:45:45,203 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label21.c [2025-01-08 23:45:45,219 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:45:45,221 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label21.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:45:45,299 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:45:45,309 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;@4daac089, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:45:45,310 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:45:45,319 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:45,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-08 23:45:45,326 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:45:45,326 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:45:45,327 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:45:45,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:45:45,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1608847818, now seen corresponding path program 1 times [2025-01-08 23:45:45,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:45:45,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788270565] [2025-01-08 23:45:45,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:45:45,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:45:45,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-08 23:45:45,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-08 23:45:45,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:45:45,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:45:45,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:45:45,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:45:45,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788270565] [2025-01-08 23:45:45,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788270565] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:45:45,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:45:45,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:45:45,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993529041] [2025-01-08 23:45:45,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:45:45,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:45:45,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:45:45,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:45:45,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:45:45,651 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:49,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:45:49,085 INFO L93 Difference]: Finished difference Result 2388 states and 4626 transitions. [2025-01-08 23:45:49,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:45:49,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-01-08 23:45:49,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:45:49,113 INFO L225 Difference]: With dead ends: 2388 [2025-01-08 23:45:49,113 INFO L226 Difference]: Without dead ends: 1506 [2025-01-08 23:45:49,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:45:49,121 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 875 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2437 mSolverCounterSat, 771 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 3208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 771 IncrementalHoareTripleChecker+Valid, 2437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:45:49,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 156 Invalid, 3208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [771 Valid, 2437 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-01-08 23:45:49,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-01-08 23:45:49,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2025-01-08 23:45:49,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1505 states have (on average 1.8458471760797341) internal successors, (2778), 1505 states have internal predecessors, (2778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:49,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2778 transitions. [2025-01-08 23:45:49,243 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2778 transitions. Word has length 22 [2025-01-08 23:45:49,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:45:49,244 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 2778 transitions. [2025-01-08 23:45:49,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:49,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2778 transitions. [2025-01-08 23:45:49,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-08 23:45:49,247 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:45:49,247 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:45:49,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:45:49,248 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:45:49,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:45:49,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1349657785, now seen corresponding path program 1 times [2025-01-08 23:45:49,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:45:49,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611815628] [2025-01-08 23:45:49,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:45:49,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:45:49,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-08 23:45:49,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-08 23:45:49,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:45:49,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:45:49,524 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:45:49,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:45:49,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611815628] [2025-01-08 23:45:49,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611815628] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:45:49,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:45:49,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:45:49,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376948704] [2025-01-08 23:45:49,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:45:49,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:45:49,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:45:49,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:45:49,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:45:49,529 INFO L87 Difference]: Start difference. First operand 1506 states and 2778 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:52,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:45:52,556 INFO L93 Difference]: Finished difference Result 3761 states and 6893 transitions. [2025-01-08 23:45:52,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:45:52,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-01-08 23:45:52,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:45:52,567 INFO L225 Difference]: With dead ends: 3761 [2025-01-08 23:45:52,567 INFO L226 Difference]: Without dead ends: 2257 [2025-01-08 23:45:52,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:45:52,570 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 780 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 864 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 2859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:45:52,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 448 Invalid, 2859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-08 23:45:52,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2025-01-08 23:45:52,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 2257. [2025-01-08 23:45:52,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2257 states, 2256 states have (on average 1.4419326241134751) internal successors, (3253), 2256 states have internal predecessors, (3253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:52,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 3253 transitions. [2025-01-08 23:45:52,634 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 3253 transitions. Word has length 91 [2025-01-08 23:45:52,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:45:52,634 INFO L471 AbstractCegarLoop]: Abstraction has 2257 states and 3253 transitions. [2025-01-08 23:45:52,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:52,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 3253 transitions. [2025-01-08 23:45:52,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-08 23:45:52,637 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:45:52,637 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:45:52,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:45:52,637 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:45:52,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:45:52,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1615296108, now seen corresponding path program 1 times [2025-01-08 23:45:52,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:45:52,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031420754] [2025-01-08 23:45:52,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:45:52,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:45:52,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-08 23:45:52,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-08 23:45:52,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:45:52,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:45:53,057 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:45:53,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:45:53,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031420754] [2025-01-08 23:45:53,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031420754] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:45:53,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267400999] [2025-01-08 23:45:53,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:45:53,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:45:53,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:45:53,062 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-08 23:45:53,064 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-08 23:45:53,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-08 23:45:53,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-08 23:45:53,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:45:53,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:45:53,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:45:53,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:45:53,195 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:45:53,195 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:45:53,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267400999] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:45:53,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:45:53,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:45:53,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666543524] [2025-01-08 23:45:53,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:45:53,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:45:53,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:45:53,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:45:53,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:45:53,197 INFO L87 Difference]: Start difference. First operand 2257 states and 3253 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:55,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:45:55,920 INFO L93 Difference]: Finished difference Result 6765 states and 9754 transitions. [2025-01-08 23:45:55,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:45:55,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-01-08 23:45:55,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:45:55,939 INFO L225 Difference]: With dead ends: 6765 [2025-01-08 23:45:55,940 INFO L226 Difference]: Without dead ends: 4510 [2025-01-08 23:45:55,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:45:55,945 INFO L435 NwaCegarLoop]: 1370 mSDtfsCounter, 734 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2515 mSolverCounterSat, 574 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 1378 SdHoareTripleChecker+Invalid, 3089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 574 IncrementalHoareTripleChecker+Valid, 2515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:45:55,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 1378 Invalid, 3089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [574 Valid, 2515 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-08 23:45:55,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4510 states. [2025-01-08 23:45:56,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4510 to 4510. [2025-01-08 23:45:56,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4510 states, 4509 states have (on average 1.3714792636948325) internal successors, (6184), 4509 states have internal predecessors, (6184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:56,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4510 states to 4510 states and 6184 transitions. [2025-01-08 23:45:56,033 INFO L78 Accepts]: Start accepts. Automaton has 4510 states and 6184 transitions. Word has length 93 [2025-01-08 23:45:56,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:45:56,033 INFO L471 AbstractCegarLoop]: Abstraction has 4510 states and 6184 transitions. [2025-01-08 23:45:56,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:56,034 INFO L276 IsEmpty]: Start isEmpty. Operand 4510 states and 6184 transitions. [2025-01-08 23:45:56,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-08 23:45:56,040 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:45:56,040 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:45:56,049 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-08 23:45:56,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:45:56,242 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:45:56,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:45:56,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1013227557, now seen corresponding path program 1 times [2025-01-08 23:45:56,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:45:56,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278091334] [2025-01-08 23:45:56,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:45:56,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:45:56,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-08 23:45:56,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-08 23:45:56,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:45:56,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:45:56,568 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:45:56,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:45:56,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278091334] [2025-01-08 23:45:56,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278091334] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:45:56,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:45:56,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:45:56,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092931263] [2025-01-08 23:45:56,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:45:56,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:45:56,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:45:56,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:45:56,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:45:56,571 INFO L87 Difference]: Start difference. First operand 4510 states and 6184 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:00,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:00,311 INFO L93 Difference]: Finished difference Result 9769 states and 13273 transitions. [2025-01-08 23:46:00,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:46:00,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-01-08 23:46:00,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:00,332 INFO L225 Difference]: With dead ends: 9769 [2025-01-08 23:46:00,333 INFO L226 Difference]: Without dead ends: 5261 [2025-01-08 23:46:00,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:46:00,340 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 2182 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4828 mSolverCounterSat, 659 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2182 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 5487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 659 IncrementalHoareTripleChecker+Valid, 4828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:00,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2182 Valid, 240 Invalid, 5487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [659 Valid, 4828 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-01-08 23:46:00,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5261 states. [2025-01-08 23:46:00,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5261 to 5261. [2025-01-08 23:46:00,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5261 states, 5260 states have (on average 1.2979087452471483) internal successors, (6827), 5260 states have internal predecessors, (6827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:00,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5261 states to 5261 states and 6827 transitions. [2025-01-08 23:46:00,483 INFO L78 Accepts]: Start accepts. Automaton has 5261 states and 6827 transitions. Word has length 99 [2025-01-08 23:46:00,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:00,483 INFO L471 AbstractCegarLoop]: Abstraction has 5261 states and 6827 transitions. [2025-01-08 23:46:00,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:00,485 INFO L276 IsEmpty]: Start isEmpty. Operand 5261 states and 6827 transitions. [2025-01-08 23:46:00,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-08 23:46:00,489 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:00,489 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:46:00,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:46:00,489 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:00,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:00,490 INFO L85 PathProgramCache]: Analyzing trace with hash -76746597, now seen corresponding path program 1 times [2025-01-08 23:46:00,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:00,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555135891] [2025-01-08 23:46:00,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:00,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:00,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-08 23:46:00,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-08 23:46:00,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:00,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:00,875 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:46:00,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:00,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555135891] [2025-01-08 23:46:00,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555135891] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:00,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:46:00,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:46:00,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470211282] [2025-01-08 23:46:00,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:00,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:46:00,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:00,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:46:00,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:46:00,877 INFO L87 Difference]: Start difference. First operand 5261 states and 6827 transitions. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:03,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:03,871 INFO L93 Difference]: Finished difference Result 12810 states and 17221 transitions. [2025-01-08 23:46:03,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:46:03,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2025-01-08 23:46:03,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:03,892 INFO L225 Difference]: With dead ends: 12810 [2025-01-08 23:46:03,892 INFO L226 Difference]: Without dead ends: 8265 [2025-01-08 23:46:03,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:46:03,900 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 702 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3049 mSolverCounterSat, 723 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 3772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 723 IncrementalHoareTripleChecker+Valid, 3049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:03,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 612 Invalid, 3772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [723 Valid, 3049 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-08 23:46:03,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8265 states. [2025-01-08 23:46:03,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8265 to 7514. [2025-01-08 23:46:04,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7514 states, 7513 states have (on average 1.213097298016771) internal successors, (9114), 7513 states have internal predecessors, (9114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:04,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7514 states to 7514 states and 9114 transitions. [2025-01-08 23:46:04,016 INFO L78 Accepts]: Start accepts. Automaton has 7514 states and 9114 transitions. Word has length 170 [2025-01-08 23:46:04,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:04,017 INFO L471 AbstractCegarLoop]: Abstraction has 7514 states and 9114 transitions. [2025-01-08 23:46:04,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:04,017 INFO L276 IsEmpty]: Start isEmpty. Operand 7514 states and 9114 transitions. [2025-01-08 23:46:04,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-01-08 23:46:04,020 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:04,020 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:46:04,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:46:04,020 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:04,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:04,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1249247616, now seen corresponding path program 1 times [2025-01-08 23:46:04,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:04,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319588453] [2025-01-08 23:46:04,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:04,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:04,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-01-08 23:46:04,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-01-08 23:46:04,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:04,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:04,272 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-01-08 23:46:04,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:04,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319588453] [2025-01-08 23:46:04,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319588453] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:04,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:46:04,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:46:04,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144734091] [2025-01-08 23:46:04,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:04,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:46:04,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:04,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:46:04,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:04,276 INFO L87 Difference]: Start difference. First operand 7514 states and 9114 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:06,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:06,894 INFO L93 Difference]: Finished difference Result 18783 states and 23429 transitions. [2025-01-08 23:46:06,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:46:06,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 244 [2025-01-08 23:46:06,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:06,928 INFO L225 Difference]: With dead ends: 18783 [2025-01-08 23:46:06,929 INFO L226 Difference]: Without dead ends: 12022 [2025-01-08 23:46:06,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:06,938 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 848 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 2775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:06,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 312 Invalid, 2775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:46:06,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12022 states. [2025-01-08 23:46:07,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12022 to 11269. [2025-01-08 23:46:07,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11269 states, 11268 states have (on average 1.1975505857294995) internal successors, (13494), 11268 states have internal predecessors, (13494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:07,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11269 states to 11269 states and 13494 transitions. [2025-01-08 23:46:07,097 INFO L78 Accepts]: Start accepts. Automaton has 11269 states and 13494 transitions. Word has length 244 [2025-01-08 23:46:07,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:07,097 INFO L471 AbstractCegarLoop]: Abstraction has 11269 states and 13494 transitions. [2025-01-08 23:46:07,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:07,098 INFO L276 IsEmpty]: Start isEmpty. Operand 11269 states and 13494 transitions. [2025-01-08 23:46:07,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-01-08 23:46:07,101 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:07,102 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:46:07,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:46:07,102 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:07,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:07,103 INFO L85 PathProgramCache]: Analyzing trace with hash -980217474, now seen corresponding path program 1 times [2025-01-08 23:46:07,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:07,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032340614] [2025-01-08 23:46:07,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:07,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:07,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-01-08 23:46:07,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-01-08 23:46:07,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:07,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:07,611 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-01-08 23:46:07,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:07,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032340614] [2025-01-08 23:46:07,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032340614] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:07,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:46:07,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:46:07,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427766509] [2025-01-08 23:46:07,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:07,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:46:07,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:07,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:46:07,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:07,613 INFO L87 Difference]: Start difference. First operand 11269 states and 13494 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:10,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:10,144 INFO L93 Difference]: Finished difference Result 26291 states and 32289 transitions. [2025-01-08 23:46:10,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:46:10,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 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 311 [2025-01-08 23:46:10,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:10,178 INFO L225 Difference]: With dead ends: 26291 [2025-01-08 23:46:10,179 INFO L226 Difference]: Without dead ends: 15775 [2025-01-08 23:46:10,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:10,192 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 829 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2037 mSolverCounterSat, 1005 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 3042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1005 IncrementalHoareTripleChecker+Valid, 2037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:10,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 142 Invalid, 3042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1005 Valid, 2037 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:46:10,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15775 states. [2025-01-08 23:46:10,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15775 to 15775. [2025-01-08 23:46:10,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15775 states, 15774 states have (on average 1.2147838214783822) internal successors, (19162), 15774 states have internal predecessors, (19162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:10,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15775 states to 15775 states and 19162 transitions. [2025-01-08 23:46:10,385 INFO L78 Accepts]: Start accepts. Automaton has 15775 states and 19162 transitions. Word has length 311 [2025-01-08 23:46:10,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:10,386 INFO L471 AbstractCegarLoop]: Abstraction has 15775 states and 19162 transitions. [2025-01-08 23:46:10,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:10,387 INFO L276 IsEmpty]: Start isEmpty. Operand 15775 states and 19162 transitions. [2025-01-08 23:46:10,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-01-08 23:46:10,391 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:10,392 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:46:10,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:46:10,392 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:10,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:10,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1007645108, now seen corresponding path program 1 times [2025-01-08 23:46:10,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:10,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185410276] [2025-01-08 23:46:10,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:10,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:10,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-01-08 23:46:10,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-01-08 23:46:10,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:10,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:10,921 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 59 proven. 108 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-08 23:46:10,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:10,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185410276] [2025-01-08 23:46:10,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185410276] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:46:10,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841382728] [2025-01-08 23:46:10,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:10,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:46:10,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:46:10,925 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-08 23:46:10,928 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-08 23:46:10,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-01-08 23:46:11,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-01-08 23:46:11,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:11,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:11,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:46:11,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:46:11,225 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-01-08 23:46:11,227 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:46:11,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841382728] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:11,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:46:11,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-08 23:46:11,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377934597] [2025-01-08 23:46:11,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:11,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:46:11,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:11,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:46:11,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:46:11,233 INFO L87 Difference]: Start difference. First operand 15775 states and 19162 transitions. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 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-08 23:46:13,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:13,713 INFO L93 Difference]: Finished difference Result 34552 states and 42441 transitions. [2025-01-08 23:46:13,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:46:13,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 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) Word has length 340 [2025-01-08 23:46:13,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:13,744 INFO L225 Difference]: With dead ends: 34552 [2025-01-08 23:46:13,744 INFO L226 Difference]: Without dead ends: 19530 [2025-01-08 23:46:13,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:46:13,758 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 763 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 707 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 2782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 707 IncrementalHoareTripleChecker+Valid, 2075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:13,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 238 Invalid, 2782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [707 Valid, 2075 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-08 23:46:13,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19530 states. [2025-01-08 23:46:13,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19530 to 19530. [2025-01-08 23:46:14,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19530 states, 19529 states have (on average 1.2128629218085925) internal successors, (23686), 19529 states have internal predecessors, (23686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:14,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19530 states to 19530 states and 23686 transitions. [2025-01-08 23:46:14,041 INFO L78 Accepts]: Start accepts. Automaton has 19530 states and 23686 transitions. Word has length 340 [2025-01-08 23:46:14,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:14,041 INFO L471 AbstractCegarLoop]: Abstraction has 19530 states and 23686 transitions. [2025-01-08 23:46:14,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 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-08 23:46:14,042 INFO L276 IsEmpty]: Start isEmpty. Operand 19530 states and 23686 transitions. [2025-01-08 23:46:14,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-01-08 23:46:14,049 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:14,049 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:46:14,057 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-08 23:46:14,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:46:14,250 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:14,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:14,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1127726691, now seen corresponding path program 1 times [2025-01-08 23:46:14,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:14,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170586037] [2025-01-08 23:46:14,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:14,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:14,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-01-08 23:46:14,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-01-08 23:46:14,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:14,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:14,610 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-08 23:46:14,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:14,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170586037] [2025-01-08 23:46:14,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170586037] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:14,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:46:14,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:46:14,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753315007] [2025-01-08 23:46:14,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:14,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:46:14,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:14,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:46:14,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:14,612 INFO L87 Difference]: Start difference. First operand 19530 states and 23686 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:17,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:17,463 INFO L93 Difference]: Finished difference Result 48070 states and 58712 transitions. [2025-01-08 23:46:17,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:46:17,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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 349 [2025-01-08 23:46:17,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:17,502 INFO L225 Difference]: With dead ends: 48070 [2025-01-08 23:46:17,502 INFO L226 Difference]: Without dead ends: 29293 [2025-01-08 23:46:17,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:17,524 INFO L435 NwaCegarLoop]: 1239 mSDtfsCounter, 635 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2625 mSolverCounterSat, 333 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 2958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 333 IncrementalHoareTripleChecker+Valid, 2625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:17,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 1247 Invalid, 2958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [333 Valid, 2625 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-08 23:46:17,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29293 states. [2025-01-08 23:46:17,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29293 to 27791. [2025-01-08 23:46:17,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27791 states, 27790 states have (on average 1.2121266642677222) internal successors, (33685), 27790 states have internal predecessors, (33685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:17,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27791 states to 27791 states and 33685 transitions. [2025-01-08 23:46:17,933 INFO L78 Accepts]: Start accepts. Automaton has 27791 states and 33685 transitions. Word has length 349 [2025-01-08 23:46:17,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:17,933 INFO L471 AbstractCegarLoop]: Abstraction has 27791 states and 33685 transitions. [2025-01-08 23:46:17,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:17,934 INFO L276 IsEmpty]: Start isEmpty. Operand 27791 states and 33685 transitions. [2025-01-08 23:46:17,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-01-08 23:46:17,940 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:17,940 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:46:17,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:46:17,941 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:17,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:17,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1208047571, now seen corresponding path program 1 times [2025-01-08 23:46:17,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:17,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171616557] [2025-01-08 23:46:17,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:17,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:17,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-01-08 23:46:18,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-01-08 23:46:18,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:18,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:18,239 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-01-08 23:46:18,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:18,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171616557] [2025-01-08 23:46:18,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171616557] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:18,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:46:18,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:46:18,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339048663] [2025-01-08 23:46:18,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:18,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:46:18,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:18,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:46:18,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:18,242 INFO L87 Difference]: Start difference. First operand 27791 states and 33685 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:20,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:20,799 INFO L93 Difference]: Finished difference Result 63841 states and 78433 transitions. [2025-01-08 23:46:20,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:46:20,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 353 [2025-01-08 23:46:20,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:20,843 INFO L225 Difference]: With dead ends: 63841 [2025-01-08 23:46:20,844 INFO L226 Difference]: Without dead ends: 36803 [2025-01-08 23:46:20,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:20,869 INFO L435 NwaCegarLoop]: 1109 mSDtfsCounter, 853 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2347 mSolverCounterSat, 428 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 2775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 428 IncrementalHoareTripleChecker+Valid, 2347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:20,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 1117 Invalid, 2775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [428 Valid, 2347 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:46:20,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36803 states. [2025-01-08 23:46:21,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36803 to 36803. [2025-01-08 23:46:21,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36803 states, 36802 states have (on average 1.2022444432367807) internal successors, (44245), 36802 states have internal predecessors, (44245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:21,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36803 states to 36803 states and 44245 transitions. [2025-01-08 23:46:21,414 INFO L78 Accepts]: Start accepts. Automaton has 36803 states and 44245 transitions. Word has length 353 [2025-01-08 23:46:21,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:21,415 INFO L471 AbstractCegarLoop]: Abstraction has 36803 states and 44245 transitions. [2025-01-08 23:46:21,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:21,415 INFO L276 IsEmpty]: Start isEmpty. Operand 36803 states and 44245 transitions. [2025-01-08 23:46:21,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-01-08 23:46:21,421 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:21,421 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:46:21,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 23:46:21,421 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:21,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:21,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1999742442, now seen corresponding path program 1 times [2025-01-08 23:46:21,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:21,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645888282] [2025-01-08 23:46:21,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:21,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:21,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-01-08 23:46:21,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-01-08 23:46:21,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:21,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:21,675 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-01-08 23:46:21,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:21,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645888282] [2025-01-08 23:46:21,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645888282] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:21,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:46:21,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:46:21,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175719751] [2025-01-08 23:46:21,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:21,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:46:21,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:21,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:46:21,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:21,677 INFO L87 Difference]: Start difference. First operand 36803 states and 44245 transitions. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 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-08 23:46:24,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:24,380 INFO L93 Difference]: Finished difference Result 102893 states and 124480 transitions. [2025-01-08 23:46:24,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:46:24,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 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) Word has length 408 [2025-01-08 23:46:24,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:24,451 INFO L225 Difference]: With dead ends: 102893 [2025-01-08 23:46:24,451 INFO L226 Difference]: Without dead ends: 66843 [2025-01-08 23:46:24,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:24,479 INFO L435 NwaCegarLoop]: 1294 mSDtfsCounter, 682 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2161 mSolverCounterSat, 703 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 2864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 703 IncrementalHoareTripleChecker+Valid, 2161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:24,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 1302 Invalid, 2864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [703 Valid, 2161 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:46:24,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66843 states. [2025-01-08 23:46:24,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66843 to 64590. [2025-01-08 23:46:24,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64590 states, 64589 states have (on average 1.1479354069578411) internal successors, (74144), 64589 states have internal predecessors, (74144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:25,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64590 states to 64590 states and 74144 transitions. [2025-01-08 23:46:25,086 INFO L78 Accepts]: Start accepts. Automaton has 64590 states and 74144 transitions. Word has length 408 [2025-01-08 23:46:25,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:25,087 INFO L471 AbstractCegarLoop]: Abstraction has 64590 states and 74144 transitions. [2025-01-08 23:46:25,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 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-08 23:46:25,087 INFO L276 IsEmpty]: Start isEmpty. Operand 64590 states and 74144 transitions. [2025-01-08 23:46:25,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-01-08 23:46:25,096 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:25,098 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:46:25,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 23:46:25,098 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:25,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:25,099 INFO L85 PathProgramCache]: Analyzing trace with hash -253857257, now seen corresponding path program 1 times [2025-01-08 23:46:25,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:25,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004241130] [2025-01-08 23:46:25,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:25,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:25,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-01-08 23:46:25,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-01-08 23:46:25,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:25,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:25,513 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 513 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-01-08 23:46:25,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:25,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004241130] [2025-01-08 23:46:25,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004241130] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:25,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:46:25,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:46:25,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019228866] [2025-01-08 23:46:25,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:25,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:46:25,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:25,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:46:25,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:25,517 INFO L87 Difference]: Start difference. First operand 64590 states and 74144 transitions. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:28,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:28,269 INFO L93 Difference]: Finished difference Result 129929 states and 149046 transitions. [2025-01-08 23:46:28,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:46:28,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 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 453 [2025-01-08 23:46:28,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:28,342 INFO L225 Difference]: With dead ends: 129929 [2025-01-08 23:46:28,342 INFO L226 Difference]: Without dead ends: 66092 [2025-01-08 23:46:28,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:28,381 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 724 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2254 mSolverCounterSat, 713 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 2967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 713 IncrementalHoareTripleChecker+Valid, 2254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:28,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 145 Invalid, 2967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [713 Valid, 2254 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:46:28,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66092 states. [2025-01-08 23:46:29,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66092 to 64590. [2025-01-08 23:46:29,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64590 states, 64589 states have (on average 1.141664989394479) internal successors, (73739), 64589 states have internal predecessors, (73739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:29,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64590 states to 64590 states and 73739 transitions. [2025-01-08 23:46:29,188 INFO L78 Accepts]: Start accepts. Automaton has 64590 states and 73739 transitions. Word has length 453 [2025-01-08 23:46:29,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:29,188 INFO L471 AbstractCegarLoop]: Abstraction has 64590 states and 73739 transitions. [2025-01-08 23:46:29,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:29,189 INFO L276 IsEmpty]: Start isEmpty. Operand 64590 states and 73739 transitions. [2025-01-08 23:46:29,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-01-08 23:46:29,197 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:29,198 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:46:29,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 23:46:29,198 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:29,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:29,199 INFO L85 PathProgramCache]: Analyzing trace with hash 2024647247, now seen corresponding path program 1 times [2025-01-08 23:46:29,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:29,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193234658] [2025-01-08 23:46:29,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:29,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:29,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-01-08 23:46:29,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-01-08 23:46:29,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:29,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:29,462 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-01-08 23:46:29,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:29,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193234658] [2025-01-08 23:46:29,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193234658] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:29,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:46:29,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:46:29,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183761379] [2025-01-08 23:46:29,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:29,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:46:29,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:29,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:46:29,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:29,465 INFO L87 Difference]: Start difference. First operand 64590 states and 73739 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:32,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:32,335 INFO L93 Difference]: Finished difference Result 159218 states and 183921 transitions. [2025-01-08 23:46:32,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:46:32,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 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 457 [2025-01-08 23:46:32,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:32,444 INFO L225 Difference]: With dead ends: 159218 [2025-01-08 23:46:32,444 INFO L226 Difference]: Without dead ends: 95381 [2025-01-08 23:46:32,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:32,474 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 772 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2300 mSolverCounterSat, 563 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 2863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 563 IncrementalHoareTripleChecker+Valid, 2300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:32,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 518 Invalid, 2863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [563 Valid, 2300 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:46:32,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95381 states. [2025-01-08 23:46:33,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95381 to 91626. [2025-01-08 23:46:33,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91626 states, 91625 states have (on average 1.1285238744884039) internal successors, (103401), 91625 states have internal predecessors, (103401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:33,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91626 states to 91626 states and 103401 transitions. [2025-01-08 23:46:33,435 INFO L78 Accepts]: Start accepts. Automaton has 91626 states and 103401 transitions. Word has length 457 [2025-01-08 23:46:33,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:33,436 INFO L471 AbstractCegarLoop]: Abstraction has 91626 states and 103401 transitions. [2025-01-08 23:46:33,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:33,436 INFO L276 IsEmpty]: Start isEmpty. Operand 91626 states and 103401 transitions. [2025-01-08 23:46:33,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-01-08 23:46:33,448 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:33,448 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:46:33,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 23:46:33,448 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:33,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:33,449 INFO L85 PathProgramCache]: Analyzing trace with hash -628702826, now seen corresponding path program 1 times [2025-01-08 23:46:33,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:33,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703145909] [2025-01-08 23:46:33,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:33,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:33,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-01-08 23:46:33,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-01-08 23:46:33,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:33,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:33,943 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2025-01-08 23:46:33,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:33,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703145909] [2025-01-08 23:46:33,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703145909] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:33,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:46:33,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:46:33,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926443253] [2025-01-08 23:46:33,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:33,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:46:33,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:33,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:46:33,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:33,946 INFO L87 Difference]: Start difference. First operand 91626 states and 103401 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:36,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:36,987 INFO L93 Difference]: Finished difference Result 253093 states and 286565 transitions. [2025-01-08 23:46:36,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:46:36,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 496 [2025-01-08 23:46:36,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:37,185 INFO L225 Difference]: With dead ends: 253093 [2025-01-08 23:46:37,186 INFO L226 Difference]: Without dead ends: 162220 [2025-01-08 23:46:37,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:37,258 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 764 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2285 mSolverCounterSat, 655 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 2940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 655 IncrementalHoareTripleChecker+Valid, 2285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:37,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 517 Invalid, 2940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [655 Valid, 2285 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:46:37,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162220 states. [2025-01-08 23:46:39,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162220 to 157714. [2025-01-08 23:46:39,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157714 states, 157713 states have (on average 1.1117092440065182) internal successors, (175331), 157713 states have internal predecessors, (175331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:39,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157714 states to 157714 states and 175331 transitions. [2025-01-08 23:46:39,430 INFO L78 Accepts]: Start accepts. Automaton has 157714 states and 175331 transitions. Word has length 496 [2025-01-08 23:46:39,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:39,431 INFO L471 AbstractCegarLoop]: Abstraction has 157714 states and 175331 transitions. [2025-01-08 23:46:39,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:39,431 INFO L276 IsEmpty]: Start isEmpty. Operand 157714 states and 175331 transitions. [2025-01-08 23:46:39,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2025-01-08 23:46:39,457 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:39,458 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:46:39,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 23:46:39,458 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:39,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:39,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1512876320, now seen corresponding path program 1 times [2025-01-08 23:46:39,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:39,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158159567] [2025-01-08 23:46:39,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:39,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:39,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 647 statements into 1 equivalence classes. [2025-01-08 23:46:39,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 647 of 647 statements. [2025-01-08 23:46:39,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:39,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:40,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 225 proven. 777 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2025-01-08 23:46:40,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:40,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158159567] [2025-01-08 23:46:40,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158159567] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:46:40,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446178390] [2025-01-08 23:46:40,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:40,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:46:40,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:46:40,477 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:46:40,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-08 23:46:40,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 647 statements into 1 equivalence classes. [2025-01-08 23:46:40,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 647 of 647 statements. [2025-01-08 23:46:40,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:40,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:40,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 825 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:46:40,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:46:40,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2025-01-08 23:46:40,726 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:46:40,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446178390] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:40,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:46:40,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-01-08 23:46:40,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152773338] [2025-01-08 23:46:40,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:40,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:46:40,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:40,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:46:40,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-08 23:46:40,728 INFO L87 Difference]: Start difference. First operand 157714 states and 175331 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:43,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:43,767 INFO L93 Difference]: Finished difference Result 331948 states and 369098 transitions. [2025-01-08 23:46:43,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:46:43,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 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 647 [2025-01-08 23:46:43,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:44,255 INFO L225 Difference]: With dead ends: 331948 [2025-01-08 23:46:44,255 INFO L226 Difference]: Without dead ends: 174987 [2025-01-08 23:46:44,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 647 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-08 23:46:44,313 INFO L435 NwaCegarLoop]: 1109 mSDtfsCounter, 852 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2198 mSolverCounterSat, 428 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 2626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 428 IncrementalHoareTripleChecker+Valid, 2198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:44,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 1117 Invalid, 2626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [428 Valid, 2198 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-08 23:46:44,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174987 states. [2025-01-08 23:46:45,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174987 to 139690. [2025-01-08 23:46:45,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139690 states, 139689 states have (on average 1.110774649399738) internal successors, (155163), 139689 states have internal predecessors, (155163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:46,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139690 states to 139690 states and 155163 transitions. [2025-01-08 23:46:46,012 INFO L78 Accepts]: Start accepts. Automaton has 139690 states and 155163 transitions. Word has length 647 [2025-01-08 23:46:46,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:46,013 INFO L471 AbstractCegarLoop]: Abstraction has 139690 states and 155163 transitions. [2025-01-08 23:46:46,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:46,013 INFO L276 IsEmpty]: Start isEmpty. Operand 139690 states and 155163 transitions. [2025-01-08 23:46:46,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 704 [2025-01-08 23:46:46,036 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:46,037 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:46:46,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-08 23:46:46,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:46:46,237 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:46,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:46,238 INFO L85 PathProgramCache]: Analyzing trace with hash -799794252, now seen corresponding path program 1 times [2025-01-08 23:46:46,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:46,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528107819] [2025-01-08 23:46:46,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:46,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:46,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 703 statements into 1 equivalence classes. [2025-01-08 23:46:46,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 703 of 703 statements. [2025-01-08 23:46:46,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:46,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:46,828 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 409 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-01-08 23:46:46,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:46,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528107819] [2025-01-08 23:46:46,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528107819] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:46,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:46:46,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:46:46,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153857740] [2025-01-08 23:46:46,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:46,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:46:46,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:46,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:46:46,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:46,830 INFO L87 Difference]: Start difference. First operand 139690 states and 155163 transitions. Second operand has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:49,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:46:49,906 INFO L93 Difference]: Finished difference Result 282382 states and 313409 transitions. [2025-01-08 23:46:49,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:46:49,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 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 703 [2025-01-08 23:46:49,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:46:50,102 INFO L225 Difference]: With dead ends: 282382 [2025-01-08 23:46:50,102 INFO L226 Difference]: Without dead ends: 139690 [2025-01-08 23:46:50,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:50,165 INFO L435 NwaCegarLoop]: 1228 mSDtfsCounter, 468 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2180 mSolverCounterSat, 556 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 2736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 556 IncrementalHoareTripleChecker+Valid, 2180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:46:50,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 1235 Invalid, 2736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [556 Valid, 2180 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:46:50,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139690 states. [2025-01-08 23:46:51,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139690 to 136686. [2025-01-08 23:46:51,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136686 states, 136685 states have (on average 1.0730365438782603) internal successors, (146668), 136685 states have internal predecessors, (146668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:51,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136686 states to 136686 states and 146668 transitions. [2025-01-08 23:46:51,993 INFO L78 Accepts]: Start accepts. Automaton has 136686 states and 146668 transitions. Word has length 703 [2025-01-08 23:46:51,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:46:51,993 INFO L471 AbstractCegarLoop]: Abstraction has 136686 states and 146668 transitions. [2025-01-08 23:46:51,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:51,994 INFO L276 IsEmpty]: Start isEmpty. Operand 136686 states and 146668 transitions. [2025-01-08 23:46:52,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2025-01-08 23:46:52,015 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:52,015 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:46:52,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-08 23:46:52,015 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:52,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:52,016 INFO L85 PathProgramCache]: Analyzing trace with hash -818194184, now seen corresponding path program 1 times [2025-01-08 23:46:52,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:52,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661414844] [2025-01-08 23:46:52,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:52,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:52,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 732 statements into 1 equivalence classes. [2025-01-08 23:46:52,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 732 of 732 statements. [2025-01-08 23:46:52,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:52,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:52,304 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 613 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-01-08 23:46:52,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:52,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661414844] [2025-01-08 23:46:52,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661414844] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:52,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:46:52,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:46:52,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889904968] [2025-01-08 23:46:52,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:52,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:46:52,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:52,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:46:52,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:52,306 INFO L87 Difference]: Start difference. First operand 136686 states and 146668 transitions. Second operand has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)