./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-77.i --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/hardness-nfm22/hardness_operatoramount_amount500_file-77.i -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 395c97b3fefa9ad8a59e7498bc9bc6bbbcfb82d89d73a47ff1c4757af34546c3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:50:24,627 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:50:24,681 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:50:24,686 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:50:24,686 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:50:24,721 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:50:24,721 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:50:24,722 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:50:24,722 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:50:24,722 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:50:24,722 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:50:24,722 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:50:24,723 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:50:24,723 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:50:24,723 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:50:24,723 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:50:24,723 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:50:24,723 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:50:24,723 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:50:24,724 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:50:24,724 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:50:24,724 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:50:24,724 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:50:24,724 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:50:24,724 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:50:24,724 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:50:24,724 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:50:24,724 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:50:24,725 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:50:24,725 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:50:24,725 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:50:24,725 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:50:24,725 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:50:24,725 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:50:24,725 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:50:24,725 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:50:24,725 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:50:24,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:50:24,726 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:50:24,726 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:50:24,726 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:50:24,726 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:50:24,726 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:50:24,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:50:24,726 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:50:24,726 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:50:24,727 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:50:24,727 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:50:24,727 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 -> 395c97b3fefa9ad8a59e7498bc9bc6bbbcfb82d89d73a47ff1c4757af34546c3 [2025-01-09 14:50:25,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:50:25,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:50:25,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:50:25,015 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:50:25,015 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:50:25,016 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-77.i [2025-01-09 14:50:26,275 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/225cbe8e3/c042e697f80e4097805417dddf8d43c8/FLAG042da6ced [2025-01-09 14:50:26,652 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:50:26,654 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-77.i [2025-01-09 14:50:26,666 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/225cbe8e3/c042e697f80e4097805417dddf8d43c8/FLAG042da6ced [2025-01-09 14:50:26,679 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/225cbe8e3/c042e697f80e4097805417dddf8d43c8 [2025-01-09 14:50:26,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:50:26,682 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:50:26,683 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:50:26,683 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:50:26,687 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:50:26,688 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:50:26" (1/1) ... [2025-01-09 14:50:26,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16fd05f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:26, skipping insertion in model container [2025-01-09 14:50:26,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:50:26" (1/1) ... [2025-01-09 14:50:26,724 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:50:26,858 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/hardness-nfm22/hardness_operatoramount_amount500_file-77.i[916,929] [2025-01-09 14:50:27,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:50:27,064 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:50:27,074 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/hardness-nfm22/hardness_operatoramount_amount500_file-77.i[916,929] [2025-01-09 14:50:27,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:50:27,221 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:50:27,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:27 WrapperNode [2025-01-09 14:50:27,222 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:50:27,222 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:50:27,222 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:50:27,222 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:50:27,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:27" (1/1) ... [2025-01-09 14:50:27,260 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:27" (1/1) ... [2025-01-09 14:50:27,368 INFO L138 Inliner]: procedures = 26, calls = 70, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 795 [2025-01-09 14:50:27,368 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:50:27,369 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:50:27,369 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:50:27,369 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:50:27,378 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:27" (1/1) ... [2025-01-09 14:50:27,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:27" (1/1) ... [2025-01-09 14:50:27,409 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:27" (1/1) ... [2025-01-09 14:50:27,519 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 14:50:27,522 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:27" (1/1) ... [2025-01-09 14:50:27,522 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:27" (1/1) ... [2025-01-09 14:50:27,546 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:27" (1/1) ... [2025-01-09 14:50:27,552 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:27" (1/1) ... [2025-01-09 14:50:27,566 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:27" (1/1) ... [2025-01-09 14:50:27,595 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:27" (1/1) ... [2025-01-09 14:50:27,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:27" (1/1) ... [2025-01-09 14:50:27,622 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:50:27,624 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:50:27,624 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:50:27,624 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:50:27,625 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:27" (1/1) ... [2025-01-09 14:50:27,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:50:27,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:50:27,655 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 14:50:27,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 14:50:27,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:50:27,681 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:50:27,682 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:50:27,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:50:27,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:50:27,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:50:27,849 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:50:27,850 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:50:29,157 INFO L? ?]: Removed 97 outVars from TransFormulas that were not future-live. [2025-01-09 14:50:29,157 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:50:29,177 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:50:29,177 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 14:50:29,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:50:29 BoogieIcfgContainer [2025-01-09 14:50:29,178 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:50:29,180 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:50:29,180 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:50:29,184 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:50:29,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:50:26" (1/3) ... [2025-01-09 14:50:29,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d157f3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:50:29, skipping insertion in model container [2025-01-09 14:50:29,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:27" (2/3) ... [2025-01-09 14:50:29,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d157f3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:50:29, skipping insertion in model container [2025-01-09 14:50:29,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:50:29" (3/3) ... [2025-01-09 14:50:29,187 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-77.i [2025-01-09 14:50:29,201 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:50:29,204 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-77.i that has 2 procedures, 298 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:50:29,266 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:50:29,277 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;@33a66e68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:50:29,277 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:50:29,282 INFO L276 IsEmpty]: Start isEmpty. Operand has 298 states, 238 states have (on average 1.5672268907563025) internal successors, (373), 239 states have internal predecessors, (373), 57 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2025-01-09 14:50:29,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-01-09 14:50:29,309 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:29,310 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:50:29,310 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:29,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:29,316 INFO L85 PathProgramCache]: Analyzing trace with hash 802848512, now seen corresponding path program 1 times [2025-01-09 14:50:29,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:29,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542505196] [2025-01-09 14:50:29,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:29,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:29,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-01-09 14:50:29,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-01-09 14:50:29,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:29,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:30,034 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 6272 trivial. 0 not checked. [2025-01-09 14:50:30,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:30,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542505196] [2025-01-09 14:50:30,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542505196] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:50:30,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083372476] [2025-01-09 14:50:30,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:30,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:50:30,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:50:30,042 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:50:30,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 14:50:30,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-01-09 14:50:30,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-01-09 14:50:30,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:30,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:30,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 1130 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:50:30,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:50:30,517 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 6272 trivial. 0 not checked. [2025-01-09 14:50:30,517 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:50:30,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083372476] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:30,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:50:30,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:50:30,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266394181] [2025-01-09 14:50:30,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:30,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:50:30,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:30,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:50:30,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:50:30,550 INFO L87 Difference]: Start difference. First operand has 298 states, 238 states have (on average 1.5672268907563025) internal successors, (373), 239 states have internal predecessors, (373), 57 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) Second operand has 2 states, 2 states have (on average 67.0) internal successors, (134), 2 states have internal predecessors, (134), 2 states have call successors, (57), 2 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 2 states have call successors, (57) [2025-01-09 14:50:30,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:30,608 INFO L93 Difference]: Finished difference Result 589 states and 1024 transitions. [2025-01-09 14:50:30,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:50:30,610 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 67.0) internal successors, (134), 2 states have internal predecessors, (134), 2 states have call successors, (57), 2 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 2 states have call successors, (57) Word has length 414 [2025-01-09 14:50:30,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:30,620 INFO L225 Difference]: With dead ends: 589 [2025-01-09 14:50:30,620 INFO L226 Difference]: Without dead ends: 294 [2025-01-09 14:50:30,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 415 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:50:30,629 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:30,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:50:30,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-01-09 14:50:30,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2025-01-09 14:50:30,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 235 states have (on average 1.553191489361702) internal successors, (365), 235 states have internal predecessors, (365), 57 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2025-01-09 14:50:30,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 479 transitions. [2025-01-09 14:50:30,728 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 479 transitions. Word has length 414 [2025-01-09 14:50:30,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:30,730 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 479 transitions. [2025-01-09 14:50:30,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 67.0) internal successors, (134), 2 states have internal predecessors, (134), 2 states have call successors, (57), 2 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 2 states have call successors, (57) [2025-01-09 14:50:30,730 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 479 transitions. [2025-01-09 14:50:30,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-01-09 14:50:30,740 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:30,741 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:50:30,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 14:50:30,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 14:50:30,945 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:30,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:30,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1447425382, now seen corresponding path program 1 times [2025-01-09 14:50:30,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:30,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781293372] [2025-01-09 14:50:30,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:30,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:31,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-01-09 14:50:31,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-01-09 14:50:31,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:31,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:31,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-01-09 14:50:31,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:31,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781293372] [2025-01-09 14:50:31,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781293372] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:31,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:31,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:50:31,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743405489] [2025-01-09 14:50:31,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:31,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:50:31,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:31,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:50:31,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:50:31,473 INFO L87 Difference]: Start difference. First operand 294 states and 479 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-01-09 14:50:31,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:31,548 INFO L93 Difference]: Finished difference Result 763 states and 1246 transitions. [2025-01-09 14:50:31,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:50:31,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 414 [2025-01-09 14:50:31,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:31,557 INFO L225 Difference]: With dead ends: 763 [2025-01-09 14:50:31,558 INFO L226 Difference]: Without dead ends: 472 [2025-01-09 14:50:31,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:50:31,560 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 293 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:31,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 972 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:50:31,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-01-09 14:50:31,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 312. [2025-01-09 14:50:31,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 253 states have (on average 1.5533596837944663) internal successors, (393), 253 states have internal predecessors, (393), 57 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2025-01-09 14:50:31,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 507 transitions. [2025-01-09 14:50:31,597 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 507 transitions. Word has length 414 [2025-01-09 14:50:31,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:31,600 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 507 transitions. [2025-01-09 14:50:31,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-01-09 14:50:31,600 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 507 transitions. [2025-01-09 14:50:31,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-01-09 14:50:31,605 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:31,605 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:50:31,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:50:31,605 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:31,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:31,607 INFO L85 PathProgramCache]: Analyzing trace with hash -128980070, now seen corresponding path program 1 times [2025-01-09 14:50:31,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:31,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396303118] [2025-01-09 14:50:31,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:31,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:31,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-01-09 14:50:31,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-01-09 14:50:31,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:31,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:32,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-01-09 14:50:32,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:32,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396303118] [2025-01-09 14:50:32,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396303118] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:32,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:32,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:50:32,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158984685] [2025-01-09 14:50:32,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:32,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:50:32,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:32,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:50:32,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:50:32,098 INFO L87 Difference]: Start difference. First operand 312 states and 507 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-01-09 14:50:32,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:32,222 INFO L93 Difference]: Finished difference Result 813 states and 1317 transitions. [2025-01-09 14:50:32,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:50:32,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 414 [2025-01-09 14:50:32,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:32,227 INFO L225 Difference]: With dead ends: 813 [2025-01-09 14:50:32,228 INFO L226 Difference]: Without dead ends: 504 [2025-01-09 14:50:32,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:50:32,229 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 302 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:32,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 923 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:50:32,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-01-09 14:50:32,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 501. [2025-01-09 14:50:32,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 422 states have (on average 1.5545023696682465) internal successors, (656), 423 states have internal predecessors, (656), 76 states have call successors, (76), 2 states have call predecessors, (76), 2 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2025-01-09 14:50:32,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 808 transitions. [2025-01-09 14:50:32,266 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 808 transitions. Word has length 414 [2025-01-09 14:50:32,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:32,269 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 808 transitions. [2025-01-09 14:50:32,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-01-09 14:50:32,269 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 808 transitions. [2025-01-09 14:50:32,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-01-09 14:50:32,276 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:32,276 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:50:32,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:50:32,276 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:32,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:32,277 INFO L85 PathProgramCache]: Analyzing trace with hash -860947496, now seen corresponding path program 1 times [2025-01-09 14:50:32,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:32,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728852867] [2025-01-09 14:50:32,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:32,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:32,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-01-09 14:50:32,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-01-09 14:50:32,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:32,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:33,804 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-01-09 14:50:33,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:33,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728852867] [2025-01-09 14:50:33,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728852867] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:33,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:33,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:50:33,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835017435] [2025-01-09 14:50:33,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:33,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:50:33,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:33,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:50:33,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:50:33,807 INFO L87 Difference]: Start difference. First operand 501 states and 808 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-01-09 14:50:34,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:34,127 INFO L93 Difference]: Finished difference Result 1466 states and 2368 transitions. [2025-01-09 14:50:34,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:50:34,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 414 [2025-01-09 14:50:34,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:34,141 INFO L225 Difference]: With dead ends: 1466 [2025-01-09 14:50:34,141 INFO L226 Difference]: Without dead ends: 968 [2025-01-09 14:50:34,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-09 14:50:34,144 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 557 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:34,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 1414 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:50:34,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2025-01-09 14:50:34,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 666. [2025-01-09 14:50:34,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 528 states have (on average 1.5284090909090908) internal successors, (807), 529 states have internal predecessors, (807), 133 states have call successors, (133), 4 states have call predecessors, (133), 4 states have return successors, (133), 132 states have call predecessors, (133), 133 states have call successors, (133) [2025-01-09 14:50:34,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1073 transitions. [2025-01-09 14:50:34,217 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1073 transitions. Word has length 414 [2025-01-09 14:50:34,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:34,219 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 1073 transitions. [2025-01-09 14:50:34,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-01-09 14:50:34,220 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1073 transitions. [2025-01-09 14:50:34,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-01-09 14:50:34,224 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:34,225 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:50:34,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:50:34,225 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:34,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:34,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1828298150, now seen corresponding path program 1 times [2025-01-09 14:50:34,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:34,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317572294] [2025-01-09 14:50:34,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:34,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:34,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-01-09 14:50:34,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-01-09 14:50:34,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:34,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:35,047 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-01-09 14:50:35,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:35,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317572294] [2025-01-09 14:50:35,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317572294] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:35,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:35,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:50:35,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917428695] [2025-01-09 14:50:35,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:35,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:50:35,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:35,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:50:35,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:50:35,050 INFO L87 Difference]: Start difference. First operand 666 states and 1073 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-01-09 14:50:35,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:35,119 INFO L93 Difference]: Finished difference Result 1230 states and 1991 transitions. [2025-01-09 14:50:35,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:50:35,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 414 [2025-01-09 14:50:35,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:35,128 INFO L225 Difference]: With dead ends: 1230 [2025-01-09 14:50:35,129 INFO L226 Difference]: Without dead ends: 732 [2025-01-09 14:50:35,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:50:35,131 INFO L435 NwaCegarLoop]: 758 mSDtfsCounter, 471 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:35,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 1044 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:50:35,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2025-01-09 14:50:35,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 666. [2025-01-09 14:50:35,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 528 states have (on average 1.5208333333333333) internal successors, (803), 529 states have internal predecessors, (803), 133 states have call successors, (133), 4 states have call predecessors, (133), 4 states have return successors, (133), 132 states have call predecessors, (133), 133 states have call successors, (133) [2025-01-09 14:50:35,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1069 transitions. [2025-01-09 14:50:35,204 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1069 transitions. Word has length 414 [2025-01-09 14:50:35,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:35,205 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 1069 transitions. [2025-01-09 14:50:35,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-01-09 14:50:35,206 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1069 transitions. [2025-01-09 14:50:35,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-01-09 14:50:35,211 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:35,211 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:50:35,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:50:35,211 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:35,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:35,212 INFO L85 PathProgramCache]: Analyzing trace with hash 268213598, now seen corresponding path program 1 times [2025-01-09 14:50:35,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:35,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263752754] [2025-01-09 14:50:35,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:35,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:35,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-01-09 14:50:35,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-01-09 14:50:35,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:35,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:35,870 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-01-09 14:50:35,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:35,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263752754] [2025-01-09 14:50:35,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263752754] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:35,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:35,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:50:35,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623523957] [2025-01-09 14:50:35,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:35,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:50:35,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:35,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:50:35,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:50:35,873 INFO L87 Difference]: Start difference. First operand 666 states and 1069 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-01-09 14:50:35,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:35,969 INFO L93 Difference]: Finished difference Result 1712 states and 2753 transitions. [2025-01-09 14:50:35,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:50:35,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 414 [2025-01-09 14:50:35,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:35,979 INFO L225 Difference]: With dead ends: 1712 [2025-01-09 14:50:35,979 INFO L226 Difference]: Without dead ends: 1214 [2025-01-09 14:50:35,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:50:35,982 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 317 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:35,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 1021 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:50:35,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2025-01-09 14:50:36,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1212. [2025-01-09 14:50:36,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 996 states have (on average 1.533132530120482) internal successors, (1527), 998 states have internal predecessors, (1527), 209 states have call successors, (209), 6 states have call predecessors, (209), 6 states have return successors, (209), 207 states have call predecessors, (209), 209 states have call successors, (209) [2025-01-09 14:50:36,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1945 transitions. [2025-01-09 14:50:36,068 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1945 transitions. Word has length 414 [2025-01-09 14:50:36,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:36,069 INFO L471 AbstractCegarLoop]: Abstraction has 1212 states and 1945 transitions. [2025-01-09 14:50:36,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-01-09 14:50:36,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1945 transitions. [2025-01-09 14:50:36,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2025-01-09 14:50:36,074 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:36,075 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:50:36,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:50:36,075 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:36,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:36,076 INFO L85 PathProgramCache]: Analyzing trace with hash 2043165729, now seen corresponding path program 1 times [2025-01-09 14:50:36,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:36,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126299971] [2025-01-09 14:50:36,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:36,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:36,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-01-09 14:50:36,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-01-09 14:50:36,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:36,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:38,447 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-01-09 14:50:38,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:38,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126299971] [2025-01-09 14:50:38,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126299971] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:38,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:38,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:50:38,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105609328] [2025-01-09 14:50:38,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:38,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:50:38,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:38,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:50:38,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:50:38,451 INFO L87 Difference]: Start difference. First operand 1212 states and 1945 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-01-09 14:50:39,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:39,037 INFO L93 Difference]: Finished difference Result 3077 states and 4950 transitions. [2025-01-09 14:50:39,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:50:39,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 415 [2025-01-09 14:50:39,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:39,049 INFO L225 Difference]: With dead ends: 3077 [2025-01-09 14:50:39,049 INFO L226 Difference]: Without dead ends: 1972 [2025-01-09 14:50:39,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-09 14:50:39,052 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 533 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:39,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 1391 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:50:39,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1972 states. [2025-01-09 14:50:39,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1972 to 1212. [2025-01-09 14:50:39,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 996 states have (on average 1.5321285140562249) internal successors, (1526), 998 states have internal predecessors, (1526), 209 states have call successors, (209), 6 states have call predecessors, (209), 6 states have return successors, (209), 207 states have call predecessors, (209), 209 states have call successors, (209) [2025-01-09 14:50:39,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1944 transitions. [2025-01-09 14:50:39,184 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1944 transitions. Word has length 415 [2025-01-09 14:50:39,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:39,184 INFO L471 AbstractCegarLoop]: Abstraction has 1212 states and 1944 transitions. [2025-01-09 14:50:39,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-01-09 14:50:39,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1944 transitions. [2025-01-09 14:50:39,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2025-01-09 14:50:39,188 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:39,189 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:50:39,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:50:39,189 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:39,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:39,190 INFO L85 PathProgramCache]: Analyzing trace with hash 812726683, now seen corresponding path program 1 times [2025-01-09 14:50:39,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:39,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605118395] [2025-01-09 14:50:39,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:39,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:39,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes. [2025-01-09 14:50:39,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements. [2025-01-09 14:50:39,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:39,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:40,811 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-01-09 14:50:40,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:40,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605118395] [2025-01-09 14:50:40,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605118395] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:40,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:40,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:50:40,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878778870] [2025-01-09 14:50:40,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:40,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:50:40,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:40,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:50:40,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:50:40,817 INFO L87 Difference]: Start difference. First operand 1212 states and 1944 transitions. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-01-09 14:50:41,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:41,405 INFO L93 Difference]: Finished difference Result 4396 states and 6978 transitions. [2025-01-09 14:50:41,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:50:41,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 416 [2025-01-09 14:50:41,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:41,425 INFO L225 Difference]: With dead ends: 4396 [2025-01-09 14:50:41,425 INFO L226 Difference]: Without dead ends: 3404 [2025-01-09 14:50:41,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:50:41,429 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 1160 mSDsluCounter, 1062 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1160 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:41,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1160 Valid, 1588 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:50:41,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3404 states. [2025-01-09 14:50:41,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3404 to 2364. [2025-01-09 14:50:41,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2364 states, 2060 states have (on average 1.5592233009708738) internal successors, (3212), 2066 states have internal predecessors, (3212), 293 states have call successors, (293), 10 states have call predecessors, (293), 10 states have return successors, (293), 287 states have call predecessors, (293), 293 states have call successors, (293) [2025-01-09 14:50:41,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 3798 transitions. [2025-01-09 14:50:41,597 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 3798 transitions. Word has length 416 [2025-01-09 14:50:41,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:41,599 INFO L471 AbstractCegarLoop]: Abstraction has 2364 states and 3798 transitions. [2025-01-09 14:50:41,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-01-09 14:50:41,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 3798 transitions. [2025-01-09 14:50:41,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2025-01-09 14:50:41,605 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:41,605 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:50:41,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:50:41,605 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:41,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:41,606 INFO L85 PathProgramCache]: Analyzing trace with hash -2096037219, now seen corresponding path program 1 times [2025-01-09 14:50:41,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:41,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193644311] [2025-01-09 14:50:41,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:41,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:41,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes. [2025-01-09 14:50:42,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements. [2025-01-09 14:50:42,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:42,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:51,431 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-01-09 14:50:51,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:51,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193644311] [2025-01-09 14:50:51,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193644311] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:51,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:51,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-01-09 14:50:51,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197110891] [2025-01-09 14:50:51,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:51,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 14:50:51,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:51,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 14:50:51,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2025-01-09 14:50:51,436 INFO L87 Difference]: Start difference. First operand 2364 states and 3798 transitions. Second operand has 20 states, 20 states have (on average 6.7) internal successors, (134), 20 states have internal predecessors, (134), 4 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 4 states have call predecessors, (57), 4 states have call successors, (57) [2025-01-09 14:51:00,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:00,672 INFO L93 Difference]: Finished difference Result 12246 states and 19623 transitions. [2025-01-09 14:51:00,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 14:51:00,672 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.7) internal successors, (134), 20 states have internal predecessors, (134), 4 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 4 states have call predecessors, (57), 4 states have call successors, (57) Word has length 416 [2025-01-09 14:51:00,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:00,718 INFO L225 Difference]: With dead ends: 12246 [2025-01-09 14:51:00,718 INFO L226 Difference]: Without dead ends: 10208 [2025-01-09 14:51:00,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=276, Invalid=984, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 14:51:00,728 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 12851 mSDsluCounter, 4571 mSDsCounter, 0 mSdLazyCounter, 4007 mSolverCounterSat, 452 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12851 SdHoareTripleChecker+Valid, 4908 SdHoareTripleChecker+Invalid, 4459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 452 IncrementalHoareTripleChecker+Valid, 4007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:00,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12851 Valid, 4908 Invalid, 4459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [452 Valid, 4007 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2025-01-09 14:51:00,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10208 states. [2025-01-09 14:51:00,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10208 to 2965. [2025-01-09 14:51:00,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2965 states, 2659 states have (on average 1.578412937194434) internal successors, (4197), 2665 states have internal predecessors, (4197), 293 states have call successors, (293), 12 states have call predecessors, (293), 12 states have return successors, (293), 287 states have call predecessors, (293), 293 states have call successors, (293) [2025-01-09 14:51:00,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 4783 transitions. [2025-01-09 14:51:00,954 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 4783 transitions. Word has length 416 [2025-01-09 14:51:00,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:00,955 INFO L471 AbstractCegarLoop]: Abstraction has 2965 states and 4783 transitions. [2025-01-09 14:51:00,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.7) internal successors, (134), 20 states have internal predecessors, (134), 4 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 4 states have call predecessors, (57), 4 states have call successors, (57) [2025-01-09 14:51:00,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 4783 transitions. [2025-01-09 14:51:00,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2025-01-09 14:51:00,961 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:00,961 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:51:00,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:51:00,962 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:00,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:00,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1673335393, now seen corresponding path program 1 times [2025-01-09 14:51:00,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:00,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358404753] [2025-01-09 14:51:00,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:00,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:00,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes. [2025-01-09 14:51:02,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements. [2025-01-09 14:51:02,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:02,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:03,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 6 proven. 162 refuted. 0 times theorem prover too weak. 6216 trivial. 0 not checked. [2025-01-09 14:51:03,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:03,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358404753] [2025-01-09 14:51:03,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358404753] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:51:03,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459629703] [2025-01-09 14:51:03,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:03,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:51:03,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:51:03,118 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:51:03,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 14:51:03,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes. [2025-01-09 14:51:03,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements. [2025-01-09 14:51:03,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:03,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:03,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 1138 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:51:03,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:51:03,887 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 3228 proven. 90 refuted. 0 times theorem prover too weak. 3066 trivial. 0 not checked. [2025-01-09 14:51:03,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:51:04,278 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 78 proven. 90 refuted. 0 times theorem prover too weak. 6216 trivial. 0 not checked. [2025-01-09 14:51:04,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459629703] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:51:04,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:51:04,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 11 [2025-01-09 14:51:04,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939547716] [2025-01-09 14:51:04,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:51:04,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 14:51:04,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:04,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 14:51:04,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:51:04,281 INFO L87 Difference]: Start difference. First operand 2965 states and 4783 transitions. Second operand has 11 states, 11 states have (on average 20.90909090909091) internal successors, (230), 11 states have internal predecessors, (230), 4 states have call successors, (144), 2 states have call predecessors, (144), 4 states have return successors, (145), 4 states have call predecessors, (145), 4 states have call successors, (145) [2025-01-09 14:51:05,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:05,706 INFO L93 Difference]: Finished difference Result 6829 states and 10975 transitions. [2025-01-09 14:51:05,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 14:51:05,707 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 20.90909090909091) internal successors, (230), 11 states have internal predecessors, (230), 4 states have call successors, (144), 2 states have call predecessors, (144), 4 states have return successors, (145), 4 states have call predecessors, (145), 4 states have call successors, (145) Word has length 416 [2025-01-09 14:51:05,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:05,722 INFO L225 Difference]: With dead ends: 6829 [2025-01-09 14:51:05,722 INFO L226 Difference]: Without dead ends: 4375 [2025-01-09 14:51:05,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 857 GetRequests, 830 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2025-01-09 14:51:05,727 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 2059 mSDsluCounter, 2145 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 449 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2084 SdHoareTripleChecker+Valid, 2530 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 449 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:05,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2084 Valid, 2530 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [449 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 14:51:05,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4375 states. [2025-01-09 14:51:05,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4375 to 3357. [2025-01-09 14:51:05,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3357 states, 3047 states have (on average 1.5703971119133573) internal successors, (4785), 3053 states have internal predecessors, (4785), 293 states have call successors, (293), 16 states have call predecessors, (293), 16 states have return successors, (293), 287 states have call predecessors, (293), 293 states have call successors, (293) [2025-01-09 14:51:05,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3357 states to 3357 states and 5371 transitions. [2025-01-09 14:51:05,895 INFO L78 Accepts]: Start accepts. Automaton has 3357 states and 5371 transitions. Word has length 416 [2025-01-09 14:51:05,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:05,897 INFO L471 AbstractCegarLoop]: Abstraction has 3357 states and 5371 transitions. [2025-01-09 14:51:05,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 20.90909090909091) internal successors, (230), 11 states have internal predecessors, (230), 4 states have call successors, (144), 2 states have call predecessors, (144), 4 states have return successors, (145), 4 states have call predecessors, (145), 4 states have call successors, (145) [2025-01-09 14:51:05,898 INFO L276 IsEmpty]: Start isEmpty. Operand 3357 states and 5371 transitions. [2025-01-09 14:51:05,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2025-01-09 14:51:05,903 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:05,903 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:51:05,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 14:51:06,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:51:06,105 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:06,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:06,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1285326010, now seen corresponding path program 1 times [2025-01-09 14:51:06,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:06,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529716426] [2025-01-09 14:51:06,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:06,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:06,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 417 statements into 1 equivalence classes. [2025-01-09 14:51:06,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 417 of 417 statements. [2025-01-09 14:51:06,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:06,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:07,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-01-09 14:51:07,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:07,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529716426] [2025-01-09 14:51:07,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529716426] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:07,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:07,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:51:07,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581013133] [2025-01-09 14:51:07,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:07,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:51:07,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:07,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:51:07,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:51:07,060 INFO L87 Difference]: Start difference. First operand 3357 states and 5371 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-01-09 14:51:07,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:07,507 INFO L93 Difference]: Finished difference Result 10111 states and 16085 transitions. [2025-01-09 14:51:07,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:51:07,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 417 [2025-01-09 14:51:07,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:07,532 INFO L225 Difference]: With dead ends: 10111 [2025-01-09 14:51:07,532 INFO L226 Difference]: Without dead ends: 7529 [2025-01-09 14:51:07,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-09 14:51:07,540 INFO L435 NwaCegarLoop]: 723 mSDtfsCounter, 725 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 1889 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:07,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 1889 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:51:07,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7529 states. [2025-01-09 14:51:07,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7529 to 5977. [2025-01-09 14:51:07,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5977 states, 5499 states have (on average 1.5595562829605383) internal successors, (8576), 5513 states have internal predecessors, (8576), 453 states have call successors, (453), 24 states have call predecessors, (453), 24 states have return successors, (453), 439 states have call predecessors, (453), 453 states have call successors, (453) [2025-01-09 14:51:07,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5977 states to 5977 states and 9482 transitions. [2025-01-09 14:51:07,815 INFO L78 Accepts]: Start accepts. Automaton has 5977 states and 9482 transitions. Word has length 417 [2025-01-09 14:51:07,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:07,851 INFO L471 AbstractCegarLoop]: Abstraction has 5977 states and 9482 transitions. [2025-01-09 14:51:07,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-01-09 14:51:07,852 INFO L276 IsEmpty]: Start isEmpty. Operand 5977 states and 9482 transitions. [2025-01-09 14:51:07,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2025-01-09 14:51:07,860 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:07,860 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:51:07,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:51:07,861 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:07,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:07,862 INFO L85 PathProgramCache]: Analyzing trace with hash -391839672, now seen corresponding path program 1 times [2025-01-09 14:51:07,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:07,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115017122] [2025-01-09 14:51:07,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:07,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:07,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 417 statements into 1 equivalence classes. [2025-01-09 14:51:08,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 417 of 417 statements. [2025-01-09 14:51:08,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:08,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:09,370 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 57 proven. 111 refuted. 0 times theorem prover too weak. 6216 trivial. 0 not checked. [2025-01-09 14:51:09,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:09,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115017122] [2025-01-09 14:51:09,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115017122] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:51:09,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897332951] [2025-01-09 14:51:09,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:09,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:51:09,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:51:09,373 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-09 14:51:09,376 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-09 14:51:09,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 417 statements into 1 equivalence classes. [2025-01-09 14:51:09,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 417 of 417 statements. [2025-01-09 14:51:09,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:09,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:09,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 1143 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:51:09,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:51:10,080 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 3248 proven. 84 refuted. 0 times theorem prover too weak. 3052 trivial. 0 not checked. [2025-01-09 14:51:10,080 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:51:10,419 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 84 proven. 84 refuted. 0 times theorem prover too weak. 6216 trivial. 0 not checked. [2025-01-09 14:51:10,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897332951] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:51:10,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:51:10,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-09 14:51:10,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919865037] [2025-01-09 14:51:10,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:51:10,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:51:10,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:10,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:51:10,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:51:10,425 INFO L87 Difference]: Start difference. First operand 5977 states and 9482 transitions. Second operand has 8 states, 8 states have (on average 24.75) internal successors, (198), 8 states have internal predecessors, (198), 3 states have call successors, (122), 2 states have call predecessors, (122), 4 states have return successors, (124), 3 states have call predecessors, (124), 3 states have call successors, (124) [2025-01-09 14:51:11,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:11,001 INFO L93 Difference]: Finished difference Result 8890 states and 14065 transitions. [2025-01-09 14:51:11,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 14:51:11,001 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 24.75) internal successors, (198), 8 states have internal predecessors, (198), 3 states have call successors, (122), 2 states have call predecessors, (122), 4 states have return successors, (124), 3 states have call predecessors, (124), 3 states have call successors, (124) Word has length 417 [2025-01-09 14:51:11,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:11,014 INFO L225 Difference]: With dead ends: 8890 [2025-01-09 14:51:11,014 INFO L226 Difference]: Without dead ends: 3605 [2025-01-09 14:51:11,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 847 GetRequests, 831 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:51:11,023 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 641 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:11,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 1161 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:51:11,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3605 states. [2025-01-09 14:51:11,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3605 to 3587. [2025-01-09 14:51:11,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3587 states, 3257 states have (on average 1.5437519189438134) internal successors, (5028), 3263 states have internal predecessors, (5028), 301 states have call successors, (301), 28 states have call predecessors, (301), 28 states have return successors, (301), 295 states have call predecessors, (301), 301 states have call successors, (301) [2025-01-09 14:51:11,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3587 states to 3587 states and 5630 transitions. [2025-01-09 14:51:11,191 INFO L78 Accepts]: Start accepts. Automaton has 3587 states and 5630 transitions. Word has length 417 [2025-01-09 14:51:11,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:11,192 INFO L471 AbstractCegarLoop]: Abstraction has 3587 states and 5630 transitions. [2025-01-09 14:51:11,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.75) internal successors, (198), 8 states have internal predecessors, (198), 3 states have call successors, (122), 2 states have call predecessors, (122), 4 states have return successors, (124), 3 states have call predecessors, (124), 3 states have call successors, (124) [2025-01-09 14:51:11,193 INFO L276 IsEmpty]: Start isEmpty. Operand 3587 states and 5630 transitions. [2025-01-09 14:51:11,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2025-01-09 14:51:11,199 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:11,199 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:51:11,211 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-09 14:51:11,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:51:11,403 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:11,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:11,404 INFO L85 PathProgramCache]: Analyzing trace with hash -62512252, now seen corresponding path program 1 times [2025-01-09 14:51:11,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:11,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046266543] [2025-01-09 14:51:11,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:11,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:11,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 417 statements into 1 equivalence classes. [2025-01-09 14:51:11,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 417 of 417 statements. [2025-01-09 14:51:11,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:11,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:11,670 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-01-09 14:51:11,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:11,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046266543] [2025-01-09 14:51:11,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046266543] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:11,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:11,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:51:11,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513414336] [2025-01-09 14:51:11,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:11,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:51:11,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:11,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:51:11,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:51:11,673 INFO L87 Difference]: Start difference. First operand 3587 states and 5630 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-01-09 14:51:11,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:11,788 INFO L93 Difference]: Finished difference Result 6031 states and 9475 transitions. [2025-01-09 14:51:11,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:51:11,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 417 [2025-01-09 14:51:11,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:11,801 INFO L225 Difference]: With dead ends: 6031 [2025-01-09 14:51:11,802 INFO L226 Difference]: Without dead ends: 3587 [2025-01-09 14:51:11,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:51:11,808 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 320 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:11,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 461 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:51:11,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3587 states. [2025-01-09 14:51:11,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3587 to 3587. [2025-01-09 14:51:11,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3587 states, 3257 states have (on average 1.538225360761437) internal successors, (5010), 3263 states have internal predecessors, (5010), 301 states have call successors, (301), 28 states have call predecessors, (301), 28 states have return successors, (301), 295 states have call predecessors, (301), 301 states have call successors, (301) [2025-01-09 14:51:11,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3587 states to 3587 states and 5612 transitions. [2025-01-09 14:51:11,960 INFO L78 Accepts]: Start accepts. Automaton has 3587 states and 5612 transitions. Word has length 417 [2025-01-09 14:51:11,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:11,961 INFO L471 AbstractCegarLoop]: Abstraction has 3587 states and 5612 transitions. [2025-01-09 14:51:11,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-01-09 14:51:11,962 INFO L276 IsEmpty]: Start isEmpty. Operand 3587 states and 5612 transitions. [2025-01-09 14:51:11,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2025-01-09 14:51:11,967 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:11,968 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:51:11,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:51:11,968 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:11,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:11,969 INFO L85 PathProgramCache]: Analyzing trace with hash -940733524, now seen corresponding path program 1 times [2025-01-09 14:51:11,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:11,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868635427] [2025-01-09 14:51:11,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:11,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:12,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 418 statements into 1 equivalence classes. [2025-01-09 14:51:12,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 418 of 418 statements. [2025-01-09 14:51:12,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:12,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:12,737 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-01-09 14:51:12,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:12,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868635427] [2025-01-09 14:51:12,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868635427] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:12,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:12,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:51:12,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745084576] [2025-01-09 14:51:12,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:12,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:51:12,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:12,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:51:12,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:51:12,738 INFO L87 Difference]: Start difference. First operand 3587 states and 5612 transitions. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-01-09 14:51:13,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:13,169 INFO L93 Difference]: Finished difference Result 5693 states and 8907 transitions. [2025-01-09 14:51:13,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:51:13,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 418 [2025-01-09 14:51:13,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:13,182 INFO L225 Difference]: With dead ends: 5693 [2025-01-09 14:51:13,183 INFO L226 Difference]: Without dead ends: 4512 [2025-01-09 14:51:13,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:51:13,188 INFO L435 NwaCegarLoop]: 763 mSDtfsCounter, 623 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:13,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 1874 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:51:13,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4512 states. [2025-01-09 14:51:13,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4512 to 4378. [2025-01-09 14:51:13,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4378 states, 4008 states have (on average 1.5406686626746506) internal successors, (6175), 4016 states have internal predecessors, (6175), 339 states have call successors, (339), 30 states have call predecessors, (339), 30 states have return successors, (339), 331 states have call predecessors, (339), 339 states have call successors, (339) [2025-01-09 14:51:13,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4378 states to 4378 states and 6853 transitions. [2025-01-09 14:51:13,364 INFO L78 Accepts]: Start accepts. Automaton has 4378 states and 6853 transitions. Word has length 418 [2025-01-09 14:51:13,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:13,364 INFO L471 AbstractCegarLoop]: Abstraction has 4378 states and 6853 transitions. [2025-01-09 14:51:13,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-01-09 14:51:13,365 INFO L276 IsEmpty]: Start isEmpty. Operand 4378 states and 6853 transitions. [2025-01-09 14:51:13,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2025-01-09 14:51:13,370 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:13,371 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:51:13,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 14:51:13,371 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:13,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:13,372 INFO L85 PathProgramCache]: Analyzing trace with hash -365362260, now seen corresponding path program 1 times [2025-01-09 14:51:13,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:13,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105695844] [2025-01-09 14:51:13,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:13,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:13,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 418 statements into 1 equivalence classes. [2025-01-09 14:51:13,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 418 of 418 statements. [2025-01-09 14:51:13,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:13,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:14,484 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-01-09 14:51:14,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:14,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105695844] [2025-01-09 14:51:14,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105695844] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:14,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:14,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:51:14,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012886489] [2025-01-09 14:51:14,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:14,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:51:14,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:14,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:51:14,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:51:14,486 INFO L87 Difference]: Start difference. First operand 4378 states and 6853 transitions. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-01-09 14:51:14,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:14,848 INFO L93 Difference]: Finished difference Result 6223 states and 9743 transitions. [2025-01-09 14:51:14,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:51:14,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 418 [2025-01-09 14:51:14,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:14,859 INFO L225 Difference]: With dead ends: 6223 [2025-01-09 14:51:14,859 INFO L226 Difference]: Without dead ends: 4299 [2025-01-09 14:51:14,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:51:14,864 INFO L435 NwaCegarLoop]: 932 mSDtfsCounter, 868 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 1711 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:14,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 1711 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:51:14,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4299 states. [2025-01-09 14:51:15,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4299 to 4272. [2025-01-09 14:51:15,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4272 states, 3902 states have (on average 1.5384418247052793) internal successors, (6003), 3910 states have internal predecessors, (6003), 339 states have call successors, (339), 30 states have call predecessors, (339), 30 states have return successors, (339), 331 states have call predecessors, (339), 339 states have call successors, (339) [2025-01-09 14:51:15,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4272 states to 4272 states and 6681 transitions. [2025-01-09 14:51:15,037 INFO L78 Accepts]: Start accepts. Automaton has 4272 states and 6681 transitions. Word has length 418 [2025-01-09 14:51:15,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:15,038 INFO L471 AbstractCegarLoop]: Abstraction has 4272 states and 6681 transitions. [2025-01-09 14:51:15,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-01-09 14:51:15,039 INFO L276 IsEmpty]: Start isEmpty. Operand 4272 states and 6681 transitions. [2025-01-09 14:51:15,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2025-01-09 14:51:15,044 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:15,044 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:51:15,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 14:51:15,044 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:15,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:15,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1782757784, now seen corresponding path program 1 times [2025-01-09 14:51:15,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:15,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733840249] [2025-01-09 14:51:15,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:15,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:15,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 418 statements into 1 equivalence classes. [2025-01-09 14:51:15,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 418 of 418 statements. [2025-01-09 14:51:15,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:15,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:15,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-01-09 14:51:15,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:15,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733840249] [2025-01-09 14:51:15,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733840249] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:15,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:15,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:51:15,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682124006] [2025-01-09 14:51:15,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:15,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:51:15,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:15,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:51:15,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:51:15,781 INFO L87 Difference]: Start difference. First operand 4272 states and 6681 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-01-09 14:51:16,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:16,085 INFO L93 Difference]: Finished difference Result 7338 states and 11367 transitions. [2025-01-09 14:51:16,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:51:16,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 418 [2025-01-09 14:51:16,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:16,100 INFO L225 Difference]: With dead ends: 7338 [2025-01-09 14:51:16,100 INFO L226 Difference]: Without dead ends: 5520 [2025-01-09 14:51:16,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-09 14:51:16,106 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 397 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:16,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 1216 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:51:16,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5520 states. [2025-01-09 14:51:16,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5520 to 4240. [2025-01-09 14:51:16,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4240 states, 3902 states have (on average 1.5384418247052793) internal successors, (6003), 3908 states have internal predecessors, (6003), 301 states have call successors, (301), 36 states have call predecessors, (301), 36 states have return successors, (301), 295 states have call predecessors, (301), 301 states have call successors, (301) [2025-01-09 14:51:16,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4240 states to 4240 states and 6605 transitions. [2025-01-09 14:51:16,290 INFO L78 Accepts]: Start accepts. Automaton has 4240 states and 6605 transitions. Word has length 418 [2025-01-09 14:51:16,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:16,290 INFO L471 AbstractCegarLoop]: Abstraction has 4240 states and 6605 transitions. [2025-01-09 14:51:16,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-01-09 14:51:16,291 INFO L276 IsEmpty]: Start isEmpty. Operand 4240 states and 6605 transitions. [2025-01-09 14:51:16,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2025-01-09 14:51:16,295 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:16,296 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:51:16,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 14:51:16,296 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:16,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:16,297 INFO L85 PathProgramCache]: Analyzing trace with hash 985026796, now seen corresponding path program 1 times [2025-01-09 14:51:16,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:16,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552330065] [2025-01-09 14:51:16,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:16,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:16,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 419 statements into 1 equivalence classes. [2025-01-09 14:51:16,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 419 of 419 statements. [2025-01-09 14:51:16,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:16,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:17,071 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-01-09 14:51:17,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:17,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552330065] [2025-01-09 14:51:17,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552330065] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:17,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:17,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:51:17,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665700810] [2025-01-09 14:51:17,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:17,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:51:17,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:17,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:51:17,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:51:17,075 INFO L87 Difference]: Start difference. First operand 4240 states and 6605 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-01-09 14:51:17,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:17,336 INFO L93 Difference]: Finished difference Result 8130 states and 12601 transitions. [2025-01-09 14:51:17,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:51:17,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 419 [2025-01-09 14:51:17,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:17,352 INFO L225 Difference]: With dead ends: 8130 [2025-01-09 14:51:17,352 INFO L226 Difference]: Without dead ends: 5023 [2025-01-09 14:51:17,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-09 14:51:17,360 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 648 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:17,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 1265 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:51:17,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5023 states. [2025-01-09 14:51:17,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5023 to 3608. [2025-01-09 14:51:17,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3608 states, 3361 states have (on average 1.546861053257959) internal successors, (5199), 3363 states have internal predecessors, (5199), 217 states have call successors, (217), 29 states have call predecessors, (217), 29 states have return successors, (217), 215 states have call predecessors, (217), 217 states have call successors, (217) [2025-01-09 14:51:17,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3608 states to 3608 states and 5633 transitions. [2025-01-09 14:51:17,589 INFO L78 Accepts]: Start accepts. Automaton has 3608 states and 5633 transitions. Word has length 419 [2025-01-09 14:51:17,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:17,590 INFO L471 AbstractCegarLoop]: Abstraction has 3608 states and 5633 transitions. [2025-01-09 14:51:17,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-01-09 14:51:17,590 INFO L276 IsEmpty]: Start isEmpty. Operand 3608 states and 5633 transitions. [2025-01-09 14:51:17,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2025-01-09 14:51:17,598 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:17,598 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:51:17,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 14:51:17,599 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:17,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:17,599 INFO L85 PathProgramCache]: Analyzing trace with hash 129103668, now seen corresponding path program 1 times [2025-01-09 14:51:17,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:17,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502413566] [2025-01-09 14:51:17,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:17,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:17,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 419 statements into 1 equivalence classes. [2025-01-09 14:51:18,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 419 of 419 statements. [2025-01-09 14:51:18,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:18,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:18,983 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 72 proven. 96 refuted. 0 times theorem prover too weak. 6216 trivial. 0 not checked. [2025-01-09 14:51:18,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:18,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502413566] [2025-01-09 14:51:18,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502413566] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:51:18,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651088698] [2025-01-09 14:51:18,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:18,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:51:18,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:51:18,986 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:51:18,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 14:51:19,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 419 statements into 1 equivalence classes. [2025-01-09 14:51:19,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 419 of 419 statements. [2025-01-09 14:51:19,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:19,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:19,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 1132 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:51:19,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:51:19,646 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 3176 proven. 96 refuted. 0 times theorem prover too weak. 3112 trivial. 0 not checked. [2025-01-09 14:51:19,646 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:51:19,978 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 72 proven. 96 refuted. 0 times theorem prover too weak. 6216 trivial. 0 not checked. [2025-01-09 14:51:19,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651088698] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:51:19,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:51:19,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-09 14:51:19,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762905381] [2025-01-09 14:51:19,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:51:19,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:51:19,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:19,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:51:19,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:51:19,980 INFO L87 Difference]: Start difference. First operand 3608 states and 5633 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 2 states have call successors, (89), 2 states have call predecessors, (89), 4 states have return successors, (90), 2 states have call predecessors, (90), 2 states have call successors, (90) [2025-01-09 14:51:20,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:20,395 INFO L93 Difference]: Finished difference Result 5758 states and 8978 transitions. [2025-01-09 14:51:20,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:51:20,397 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 2 states have call successors, (89), 2 states have call predecessors, (89), 4 states have return successors, (90), 2 states have call predecessors, (90), 2 states have call successors, (90) Word has length 419 [2025-01-09 14:51:20,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:20,403 INFO L225 Difference]: With dead ends: 5758 [2025-01-09 14:51:20,403 INFO L226 Difference]: Without dead ends: 3108 [2025-01-09 14:51:20,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 845 GetRequests, 835 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:51:20,408 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 322 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:20,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1082 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:51:20,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3108 states. [2025-01-09 14:51:20,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3108 to 3084. [2025-01-09 14:51:20,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3084 states, 2834 states have (on average 1.5416372618207481) internal successors, (4369), 2836 states have internal predecessors, (4369), 217 states have call successors, (217), 32 states have call predecessors, (217), 32 states have return successors, (217), 215 states have call predecessors, (217), 217 states have call successors, (217) [2025-01-09 14:51:20,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3084 states to 3084 states and 4803 transitions. [2025-01-09 14:51:20,554 INFO L78 Accepts]: Start accepts. Automaton has 3084 states and 4803 transitions. Word has length 419 [2025-01-09 14:51:20,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:20,555 INFO L471 AbstractCegarLoop]: Abstraction has 3084 states and 4803 transitions. [2025-01-09 14:51:20,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 2 states have call successors, (89), 2 states have call predecessors, (89), 4 states have return successors, (90), 2 states have call predecessors, (90), 2 states have call successors, (90) [2025-01-09 14:51:20,556 INFO L276 IsEmpty]: Start isEmpty. Operand 3084 states and 4803 transitions. [2025-01-09 14:51:20,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2025-01-09 14:51:20,559 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:20,560 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:51:20,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 14:51:20,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 14:51:20,761 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:20,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:20,761 INFO L85 PathProgramCache]: Analyzing trace with hash -310925192, now seen corresponding path program 1 times [2025-01-09 14:51:20,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:20,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839651254] [2025-01-09 14:51:20,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:20,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:20,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 419 statements into 1 equivalence classes. [2025-01-09 14:51:21,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 419 of 419 statements. [2025-01-09 14:51:21,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:21,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:24,107 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 117 proven. 51 refuted. 0 times theorem prover too weak. 6216 trivial. 0 not checked. [2025-01-09 14:51:24,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:24,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839651254] [2025-01-09 14:51:24,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839651254] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:51:24,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239113066] [2025-01-09 14:51:24,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:24,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:51:24,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:51:24,110 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:51:24,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 14:51:24,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 419 statements into 1 equivalence classes. [2025-01-09 14:51:24,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 419 of 419 statements. [2025-01-09 14:51:24,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:24,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:24,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 1132 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-01-09 14:51:24,532 INFO L279 TraceCheckSpWp]: Computing forward predicates...