./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-41.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-41.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 d5e62ad5739342cd7c449104f0191747734ea5d5507ad0897461505e92cf32f4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:46:45,069 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:46:45,130 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:46:45,137 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:46:45,139 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:46:45,167 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:46:45,168 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:46:45,168 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:46:45,168 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:46:45,168 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:46:45,168 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:46:45,169 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:46:45,169 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:46:45,169 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:46:45,169 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:46:45,169 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:46:45,169 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:46:45,169 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:46:45,171 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:46:45,171 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:46:45,171 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:46:45,172 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:46:45,172 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:46:45,172 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:46:45,172 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:46:45,172 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:46:45,172 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:46:45,172 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:46:45,172 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:46:45,172 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:46:45,173 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:46:45,173 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:46:45,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:46:45,173 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:46:45,173 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:46:45,173 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:46:45,174 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:46:45,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:46:45,174 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:46:45,174 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:46:45,174 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:46:45,174 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:46:45,174 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:46:45,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:46:45,175 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:46:45,175 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:46:45,175 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:46:45,175 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:46:45,175 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 -> d5e62ad5739342cd7c449104f0191747734ea5d5507ad0897461505e92cf32f4 [2025-01-09 14:46:45,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:46:45,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:46:45,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:46:45,488 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:46:45,489 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:46:45,490 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-41.i [2025-01-09 14:46:46,840 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d7b51701c/1fc882a227a44d3fbb356dc283d912d8/FLAGb9cfaf547 [2025-01-09 14:46:47,226 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:46:47,230 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-41.i [2025-01-09 14:46:47,258 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d7b51701c/1fc882a227a44d3fbb356dc283d912d8/FLAGb9cfaf547 [2025-01-09 14:46:47,278 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d7b51701c/1fc882a227a44d3fbb356dc283d912d8 [2025-01-09 14:46:47,280 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:46:47,282 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:46:47,283 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:46:47,283 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:46:47,290 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:46:47,291 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:46:47" (1/1) ... [2025-01-09 14:46:47,292 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:46:47, skipping insertion in model container [2025-01-09 14:46:47,292 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:46:47" (1/1) ... [2025-01-09 14:46:47,333 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:46:47,482 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-41.i[916,929] [2025-01-09 14:46:47,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:46:47,797 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:46:47,806 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-41.i[916,929] [2025-01-09 14:46:47,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:46:47,947 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:46:47,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:47 WrapperNode [2025-01-09 14:46:47,948 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:46:47,950 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:46:47,950 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:46:47,950 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:46:47,958 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:46:47" (1/1) ... [2025-01-09 14:46:47,982 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:46:47" (1/1) ... [2025-01-09 14:46:48,063 INFO L138 Inliner]: procedures = 26, calls = 74, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 678 [2025-01-09 14:46:48,063 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:46:48,064 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:46:48,064 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:46:48,064 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:46:48,073 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:47" (1/1) ... [2025-01-09 14:46:48,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:47" (1/1) ... [2025-01-09 14:46:48,096 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:47" (1/1) ... [2025-01-09 14:46:48,144 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:46:48,145 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:47" (1/1) ... [2025-01-09 14:46:48,145 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:47" (1/1) ... [2025-01-09 14:46:48,185 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:47" (1/1) ... [2025-01-09 14:46:48,192 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:47" (1/1) ... [2025-01-09 14:46:48,203 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:47" (1/1) ... [2025-01-09 14:46:48,217 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:47" (1/1) ... [2025-01-09 14:46:48,223 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:47" (1/1) ... [2025-01-09 14:46:48,236 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:46:48,238 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:46:48,238 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:46:48,238 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:46:48,239 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:47" (1/1) ... [2025-01-09 14:46:48,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:46:48,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:46:48,270 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:46:48,276 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:46:48,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:46:48,296 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:46:48,296 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:46:48,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:46:48,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:46:48,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:46:48,434 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:46:48,436 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:46:49,650 INFO L? ?]: Removed 97 outVars from TransFormulas that were not future-live. [2025-01-09 14:46:49,651 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:46:49,668 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:46:49,668 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:46:49,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:46:49 BoogieIcfgContainer [2025-01-09 14:46:49,668 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:46:49,672 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:46:49,672 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:46:49,676 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:46:49,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:46:47" (1/3) ... [2025-01-09 14:46:49,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10258b8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:46:49, skipping insertion in model container [2025-01-09 14:46:49,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:47" (2/3) ... [2025-01-09 14:46:49,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10258b8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:46:49, skipping insertion in model container [2025-01-09 14:46:49,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:46:49" (3/3) ... [2025-01-09 14:46:49,679 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-41.i [2025-01-09 14:46:49,691 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:46:49,695 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-41.i that has 2 procedures, 263 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:46:49,763 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:46:49,774 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;@2b9d1c79, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:46:49,774 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:46:49,779 INFO L276 IsEmpty]: Start isEmpty. Operand has 263 states, 199 states have (on average 1.5628140703517588) internal successors, (311), 200 states have internal predecessors, (311), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-01-09 14:46:49,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2025-01-09 14:46:49,799 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:49,800 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:49,801 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:49,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:49,807 INFO L85 PathProgramCache]: Analyzing trace with hash 2095727121, now seen corresponding path program 1 times [2025-01-09 14:46:49,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:49,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550114524] [2025-01-09 14:46:49,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:49,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:49,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 425 statements into 1 equivalence classes. [2025-01-09 14:46:50,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 425 of 425 statements. [2025-01-09 14:46:50,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:50,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:50,793 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 14:46:50,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:50,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550114524] [2025-01-09 14:46:50,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550114524] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:50,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:50,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:46:50,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669033478] [2025-01-09 14:46:50,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:50,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:46:50,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:50,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:46:50,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:46:50,828 INFO L87 Difference]: Start difference. First operand has 263 states, 199 states have (on average 1.5628140703517588) internal successors, (311), 200 states have internal predecessors, (311), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:46:51,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:51,065 INFO L93 Difference]: Finished difference Result 762 states and 1383 transitions. [2025-01-09 14:46:51,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:46:51,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 425 [2025-01-09 14:46:51,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:51,098 INFO L225 Difference]: With dead ends: 762 [2025-01-09 14:46:51,102 INFO L226 Difference]: Without dead ends: 502 [2025-01-09 14:46:51,110 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:46:51,115 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 387 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:51,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 980 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:46:51,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-01-09 14:46:51,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 309. [2025-01-09 14:46:51,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 246 states have (on average 1.5609756097560976) internal successors, (384), 246 states have internal predecessors, (384), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-01-09 14:46:51,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 506 transitions. [2025-01-09 14:46:51,200 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 506 transitions. Word has length 425 [2025-01-09 14:46:51,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:51,203 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 506 transitions. [2025-01-09 14:46:51,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:46:51,204 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 506 transitions. [2025-01-09 14:46:51,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-01-09 14:46:51,212 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:51,213 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:51,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 14:46:51,213 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:51,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:51,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1730515111, now seen corresponding path program 1 times [2025-01-09 14:46:51,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:51,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761416648] [2025-01-09 14:46:51,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:51,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:51,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-01-09 14:46:51,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-01-09 14:46:51,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:51,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:51,744 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 14:46:51,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:51,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761416648] [2025-01-09 14:46:51,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761416648] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:51,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:51,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:46:51,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693971218] [2025-01-09 14:46:51,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:51,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:46:51,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:51,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:46:51,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:46:51,751 INFO L87 Difference]: Start difference. First operand 309 states and 506 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:46:51,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:51,856 INFO L93 Difference]: Finished difference Result 852 states and 1392 transitions. [2025-01-09 14:46:51,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:46:51,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 426 [2025-01-09 14:46:51,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:51,866 INFO L225 Difference]: With dead ends: 852 [2025-01-09 14:46:51,868 INFO L226 Difference]: Without dead ends: 546 [2025-01-09 14:46:51,870 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:46:51,871 INFO L435 NwaCegarLoop]: 691 mSDtfsCounter, 367 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:51,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 1090 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:46:51,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2025-01-09 14:46:51,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 379. [2025-01-09 14:46:51,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 316 states have (on average 1.5791139240506329) internal successors, (499), 316 states have internal predecessors, (499), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-01-09 14:46:51,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 621 transitions. [2025-01-09 14:46:51,923 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 621 transitions. Word has length 426 [2025-01-09 14:46:51,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:51,924 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 621 transitions. [2025-01-09 14:46:51,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:46:51,925 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 621 transitions. [2025-01-09 14:46:51,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-01-09 14:46:51,930 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:51,931 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:51,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:46:51,931 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:51,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:51,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1969823563, now seen corresponding path program 1 times [2025-01-09 14:46:51,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:51,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752216848] [2025-01-09 14:46:51,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:51,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:51,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-01-09 14:46:52,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-01-09 14:46:52,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:52,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:52,747 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 14:46:52,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:52,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752216848] [2025-01-09 14:46:52,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752216848] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:52,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:52,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:46:52,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28140540] [2025-01-09 14:46:52,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:52,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:46:52,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:52,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:46:52,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:46:52,753 INFO L87 Difference]: Start difference. First operand 379 states and 621 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:46:53,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:53,049 INFO L93 Difference]: Finished difference Result 989 states and 1635 transitions. [2025-01-09 14:46:53,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:46:53,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 426 [2025-01-09 14:46:53,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:53,058 INFO L225 Difference]: With dead ends: 989 [2025-01-09 14:46:53,061 INFO L226 Difference]: Without dead ends: 613 [2025-01-09 14:46:53,063 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:46:53,063 INFO L435 NwaCegarLoop]: 619 mSDtfsCounter, 200 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:53,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1034 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:46:53,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2025-01-09 14:46:53,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 379. [2025-01-09 14:46:53,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 316 states have (on average 1.5759493670886076) internal successors, (498), 316 states have internal predecessors, (498), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-01-09 14:46:53,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 620 transitions. [2025-01-09 14:46:53,102 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 620 transitions. Word has length 426 [2025-01-09 14:46:53,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:53,103 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 620 transitions. [2025-01-09 14:46:53,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:46:53,104 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 620 transitions. [2025-01-09 14:46:53,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-01-09 14:46:53,110 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:53,110 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:53,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:46:53,110 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:53,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:53,111 INFO L85 PathProgramCache]: Analyzing trace with hash 827321097, now seen corresponding path program 1 times [2025-01-09 14:46:53,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:53,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884373430] [2025-01-09 14:46:53,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:53,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:53,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-01-09 14:46:53,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-01-09 14:46:53,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:53,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:54,208 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 14:46:54,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:54,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884373430] [2025-01-09 14:46:54,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884373430] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:54,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:54,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:46:54,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74309749] [2025-01-09 14:46:54,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:54,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:46:54,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:54,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:46:54,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:46:54,211 INFO L87 Difference]: Start difference. First operand 379 states and 620 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:46:54,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:54,544 INFO L93 Difference]: Finished difference Result 1132 states and 1855 transitions. [2025-01-09 14:46:54,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:46:54,547 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 426 [2025-01-09 14:46:54,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:54,556 INFO L225 Difference]: With dead ends: 1132 [2025-01-09 14:46:54,556 INFO L226 Difference]: Without dead ends: 756 [2025-01-09 14:46:54,559 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:46:54,560 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 332 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:54,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 1235 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:46:54,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2025-01-09 14:46:54,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 489. [2025-01-09 14:46:54,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 364 states have (on average 1.510989010989011) internal successors, (550), 364 states have internal predecessors, (550), 122 states have call successors, (122), 2 states have call predecessors, (122), 2 states have return successors, (122), 122 states have call predecessors, (122), 122 states have call successors, (122) [2025-01-09 14:46:54,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 794 transitions. [2025-01-09 14:46:54,625 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 794 transitions. Word has length 426 [2025-01-09 14:46:54,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:54,627 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 794 transitions. [2025-01-09 14:46:54,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:46:54,627 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 794 transitions. [2025-01-09 14:46:54,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-01-09 14:46:54,631 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:54,632 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:54,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:46:54,632 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:54,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:54,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1733541749, now seen corresponding path program 1 times [2025-01-09 14:46:54,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:54,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475351776] [2025-01-09 14:46:54,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:54,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:54,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-01-09 14:46:55,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-01-09 14:46:55,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:55,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:56,446 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 14:46:56,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:56,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475351776] [2025-01-09 14:46:56,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475351776] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:56,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:56,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:46:56,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872764876] [2025-01-09 14:46:56,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:56,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:46:56,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:56,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:46:56,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:46:56,449 INFO L87 Difference]: Start difference. First operand 489 states and 794 transitions. Second operand has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) [2025-01-09 14:46:58,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:58,639 INFO L93 Difference]: Finished difference Result 1516 states and 2474 transitions. [2025-01-09 14:46:58,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 14:46:58,640 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) Word has length 426 [2025-01-09 14:46:58,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:58,648 INFO L225 Difference]: With dead ends: 1516 [2025-01-09 14:46:58,649 INFO L226 Difference]: Without dead ends: 1140 [2025-01-09 14:46:58,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-01-09 14:46:58,652 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 1553 mSDsluCounter, 2115 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 670 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1553 SdHoareTripleChecker+Valid, 2762 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 670 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:58,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1553 Valid, 2762 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [670 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 14:46:58,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2025-01-09 14:46:58,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 881. [2025-01-09 14:46:58,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 714 states have (on average 1.5560224089635855) internal successors, (1111), 715 states have internal predecessors, (1111), 162 states have call successors, (162), 4 states have call predecessors, (162), 4 states have return successors, (162), 161 states have call predecessors, (162), 162 states have call successors, (162) [2025-01-09 14:46:58,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1435 transitions. [2025-01-09 14:46:58,777 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1435 transitions. Word has length 426 [2025-01-09 14:46:58,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:58,778 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1435 transitions. [2025-01-09 14:46:58,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) [2025-01-09 14:46:58,779 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1435 transitions. [2025-01-09 14:46:58,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-01-09 14:46:58,783 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:58,783 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:58,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:46:58,783 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:58,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:58,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1054269495, now seen corresponding path program 1 times [2025-01-09 14:46:58,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:58,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686150211] [2025-01-09 14:46:58,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:58,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:58,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-01-09 14:46:59,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-01-09 14:46:59,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:59,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:59,845 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 14:46:59,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:59,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686150211] [2025-01-09 14:46:59,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686150211] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:59,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:59,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:46:59,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328284095] [2025-01-09 14:46:59,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:59,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:46:59,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:59,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:46:59,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:46:59,848 INFO L87 Difference]: Start difference. First operand 881 states and 1435 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:47:00,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:00,262 INFO L93 Difference]: Finished difference Result 2321 states and 3795 transitions. [2025-01-09 14:47:00,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:47:00,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 426 [2025-01-09 14:47:00,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:00,276 INFO L225 Difference]: With dead ends: 2321 [2025-01-09 14:47:00,276 INFO L226 Difference]: Without dead ends: 1551 [2025-01-09 14:47:00,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:47:00,280 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 554 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 1920 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:00,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 1920 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:47:00,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2025-01-09 14:47:00,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1434. [2025-01-09 14:47:00,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 1164 states have (on average 1.559278350515464) internal successors, (1815), 1166 states have internal predecessors, (1815), 263 states have call successors, (263), 6 states have call predecessors, (263), 6 states have return successors, (263), 261 states have call predecessors, (263), 263 states have call successors, (263) [2025-01-09 14:47:00,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 2341 transitions. [2025-01-09 14:47:00,455 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 2341 transitions. Word has length 426 [2025-01-09 14:47:00,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:00,456 INFO L471 AbstractCegarLoop]: Abstraction has 1434 states and 2341 transitions. [2025-01-09 14:47:00,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:47:00,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 2341 transitions. [2025-01-09 14:47:00,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-01-09 14:47:00,462 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:00,463 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:00,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:47:00,463 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:00,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:00,464 INFO L85 PathProgramCache]: Analyzing trace with hash 299660555, now seen corresponding path program 1 times [2025-01-09 14:47:00,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:00,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696365367] [2025-01-09 14:47:00,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:00,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:00,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-01-09 14:47:00,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-01-09 14:47:00,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:00,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:01,550 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 14:47:01,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:01,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696365367] [2025-01-09 14:47:01,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696365367] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:01,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:01,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:47:01,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499548889] [2025-01-09 14:47:01,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:01,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:47:01,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:01,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:47:01,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:47:01,553 INFO L87 Difference]: Start difference. First operand 1434 states and 2341 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:47:02,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:02,153 INFO L93 Difference]: Finished difference Result 4314 states and 7013 transitions. [2025-01-09 14:47:02,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:47:02,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 426 [2025-01-09 14:47:02,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:02,174 INFO L225 Difference]: With dead ends: 4314 [2025-01-09 14:47:02,175 INFO L226 Difference]: Without dead ends: 3207 [2025-01-09 14:47:02,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:47:02,180 INFO L435 NwaCegarLoop]: 751 mSDtfsCounter, 710 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 1627 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:02,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 1627 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:47:02,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3207 states. [2025-01-09 14:47:02,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3207 to 2445. [2025-01-09 14:47:02,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2445 states, 1989 states have (on average 1.551533433886375) internal successors, (3086), 1995 states have internal predecessors, (3086), 445 states have call successors, (445), 10 states have call predecessors, (445), 10 states have return successors, (445), 439 states have call predecessors, (445), 445 states have call successors, (445) [2025-01-09 14:47:02,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2445 states to 2445 states and 3976 transitions. [2025-01-09 14:47:02,453 INFO L78 Accepts]: Start accepts. Automaton has 2445 states and 3976 transitions. Word has length 426 [2025-01-09 14:47:02,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:02,455 INFO L471 AbstractCegarLoop]: Abstraction has 2445 states and 3976 transitions. [2025-01-09 14:47:02,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:47:02,455 INFO L276 IsEmpty]: Start isEmpty. Operand 2445 states and 3976 transitions. [2025-01-09 14:47:02,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-01-09 14:47:02,459 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:02,459 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:02,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:47:02,460 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:02,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:02,461 INFO L85 PathProgramCache]: Analyzing trace with hash 326726157, now seen corresponding path program 1 times [2025-01-09 14:47:02,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:02,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709553965] [2025-01-09 14:47:02,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:02,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:02,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-01-09 14:47:02,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-01-09 14:47:02,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:02,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:02,686 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 14:47:02,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:02,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709553965] [2025-01-09 14:47:02,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709553965] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:02,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:02,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:02,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390334669] [2025-01-09 14:47:02,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:02,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:02,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:02,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:02,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:02,689 INFO L87 Difference]: Start difference. First operand 2445 states and 3976 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:47:02,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:02,885 INFO L93 Difference]: Finished difference Result 4000 states and 6485 transitions. [2025-01-09 14:47:02,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:02,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 426 [2025-01-09 14:47:02,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:02,905 INFO L225 Difference]: With dead ends: 4000 [2025-01-09 14:47:02,905 INFO L226 Difference]: Without dead ends: 2453 [2025-01-09 14:47:02,911 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:47:02,912 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 325 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:02,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 988 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:47:02,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2453 states. [2025-01-09 14:47:03,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2453 to 1947. [2025-01-09 14:47:03,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1947 states, 1674 states have (on average 1.5836320191158901) internal successors, (2651), 1676 states have internal predecessors, (2651), 263 states have call successors, (263), 9 states have call predecessors, (263), 9 states have return successors, (263), 261 states have call predecessors, (263), 263 states have call successors, (263) [2025-01-09 14:47:03,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1947 states to 1947 states and 3177 transitions. [2025-01-09 14:47:03,164 INFO L78 Accepts]: Start accepts. Automaton has 1947 states and 3177 transitions. Word has length 426 [2025-01-09 14:47:03,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:03,164 INFO L471 AbstractCegarLoop]: Abstraction has 1947 states and 3177 transitions. [2025-01-09 14:47:03,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:47:03,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1947 states and 3177 transitions. [2025-01-09 14:47:03,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-01-09 14:47:03,172 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:03,173 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:03,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:47:03,173 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:03,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:03,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1261621745, now seen corresponding path program 1 times [2025-01-09 14:47:03,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:03,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493610273] [2025-01-09 14:47:03,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:03,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:03,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-01-09 14:47:03,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-01-09 14:47:03,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:03,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:04,379 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 14:47:04,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:04,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493610273] [2025-01-09 14:47:04,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493610273] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:04,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:04,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:47:04,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585977683] [2025-01-09 14:47:04,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:04,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:47:04,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:04,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:47:04,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:47:04,383 INFO L87 Difference]: Start difference. First operand 1947 states and 3177 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:47:05,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:05,110 INFO L93 Difference]: Finished difference Result 3824 states and 6246 transitions. [2025-01-09 14:47:05,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:47:05,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 426 [2025-01-09 14:47:05,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:05,124 INFO L225 Difference]: With dead ends: 3824 [2025-01-09 14:47:05,124 INFO L226 Difference]: Without dead ends: 2007 [2025-01-09 14:47:05,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:47:05,129 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 341 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 1554 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:05,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 1554 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:47:05,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2007 states. [2025-01-09 14:47:05,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2007 to 1947. [2025-01-09 14:47:05,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1947 states, 1674 states have (on average 1.582437275985663) internal successors, (2649), 1676 states have internal predecessors, (2649), 263 states have call successors, (263), 9 states have call predecessors, (263), 9 states have return successors, (263), 261 states have call predecessors, (263), 263 states have call successors, (263) [2025-01-09 14:47:05,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1947 states to 1947 states and 3175 transitions. [2025-01-09 14:47:05,289 INFO L78 Accepts]: Start accepts. Automaton has 1947 states and 3175 transitions. Word has length 426 [2025-01-09 14:47:05,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:05,290 INFO L471 AbstractCegarLoop]: Abstraction has 1947 states and 3175 transitions. [2025-01-09 14:47:05,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:47:05,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1947 states and 3175 transitions. [2025-01-09 14:47:05,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2025-01-09 14:47:05,294 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:05,295 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:05,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:47:05,295 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:05,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:05,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1178388470, now seen corresponding path program 1 times [2025-01-09 14:47:05,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:05,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264666165] [2025-01-09 14:47:05,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:05,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:05,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-01-09 14:47:05,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-01-09 14:47:05,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:05,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:06,737 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 14:47:06,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:06,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264666165] [2025-01-09 14:47:06,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264666165] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:06,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:06,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:47:06,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467744945] [2025-01-09 14:47:06,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:06,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:47:06,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:06,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:47:06,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:47:06,740 INFO L87 Difference]: Start difference. First operand 1947 states and 3175 transitions. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) [2025-01-09 14:47:08,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:08,342 INFO L93 Difference]: Finished difference Result 7350 states and 12003 transitions. [2025-01-09 14:47:08,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:47:08,343 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) Word has length 427 [2025-01-09 14:47:08,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:08,379 INFO L225 Difference]: With dead ends: 7350 [2025-01-09 14:47:08,379 INFO L226 Difference]: Without dead ends: 5977 [2025-01-09 14:47:08,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:47:08,387 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 969 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 1846 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:08,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 1846 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 14:47:08,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5977 states. [2025-01-09 14:47:08,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5977 to 5689. [2025-01-09 14:47:08,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5689 states, 5123 states have (on average 1.6012102283818075) internal successors, (8203), 5131 states have internal predecessors, (8203), 545 states have call successors, (545), 20 states have call predecessors, (545), 20 states have return successors, (545), 537 states have call predecessors, (545), 545 states have call successors, (545) [2025-01-09 14:47:08,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5689 states to 5689 states and 9293 transitions. [2025-01-09 14:47:08,777 INFO L78 Accepts]: Start accepts. Automaton has 5689 states and 9293 transitions. Word has length 427 [2025-01-09 14:47:08,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:08,778 INFO L471 AbstractCegarLoop]: Abstraction has 5689 states and 9293 transitions. [2025-01-09 14:47:08,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) [2025-01-09 14:47:08,778 INFO L276 IsEmpty]: Start isEmpty. Operand 5689 states and 9293 transitions. [2025-01-09 14:47:08,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2025-01-09 14:47:08,785 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:08,785 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:08,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:47:08,785 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:08,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:08,787 INFO L85 PathProgramCache]: Analyzing trace with hash -938148724, now seen corresponding path program 1 times [2025-01-09 14:47:08,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:08,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115285218] [2025-01-09 14:47:08,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:08,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:08,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-01-09 14:47:09,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-01-09 14:47:09,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:09,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:10,050 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 14:47:10,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:10,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115285218] [2025-01-09 14:47:10,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115285218] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:10,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:10,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:47:10,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897820255] [2025-01-09 14:47:10,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:10,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:47:10,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:10,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:47:10,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:47:10,057 INFO L87 Difference]: Start difference. First operand 5689 states and 9293 transitions. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:47:11,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:11,415 INFO L93 Difference]: Finished difference Result 18101 states and 29609 transitions. [2025-01-09 14:47:11,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:47:11,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 427 [2025-01-09 14:47:11,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:11,493 INFO L225 Difference]: With dead ends: 18101 [2025-01-09 14:47:11,493 INFO L226 Difference]: Without dead ends: 12953 [2025-01-09 14:47:11,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:47:11,508 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 945 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 1872 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:11,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 1872 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 14:47:11,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12953 states. [2025-01-09 14:47:12,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12953 to 9991. [2025-01-09 14:47:12,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9991 states, 8925 states have (on average 1.5747899159663865) internal successors, (14055), 8941 states have internal predecessors, (14055), 1029 states have call successors, (1029), 36 states have call predecessors, (1029), 36 states have return successors, (1029), 1013 states have call predecessors, (1029), 1029 states have call successors, (1029) [2025-01-09 14:47:12,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9991 states to 9991 states and 16113 transitions. [2025-01-09 14:47:12,321 INFO L78 Accepts]: Start accepts. Automaton has 9991 states and 16113 transitions. Word has length 427 [2025-01-09 14:47:12,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:12,322 INFO L471 AbstractCegarLoop]: Abstraction has 9991 states and 16113 transitions. [2025-01-09 14:47:12,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:47:12,324 INFO L276 IsEmpty]: Start isEmpty. Operand 9991 states and 16113 transitions. [2025-01-09 14:47:12,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2025-01-09 14:47:12,335 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:12,336 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:12,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:47:12,336 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:12,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:12,337 INFO L85 PathProgramCache]: Analyzing trace with hash -861247926, now seen corresponding path program 1 times [2025-01-09 14:47:12,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:12,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912202430] [2025-01-09 14:47:12,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:12,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:12,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-01-09 14:47:12,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-01-09 14:47:12,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:12,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:13,282 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 14:47:13,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:13,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912202430] [2025-01-09 14:47:13,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912202430] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:13,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:13,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:47:13,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403383894] [2025-01-09 14:47:13,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:13,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:47:13,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:13,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:47:13,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:47:13,286 INFO L87 Difference]: Start difference. First operand 9991 states and 16113 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:47:14,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:14,916 INFO L93 Difference]: Finished difference Result 27117 states and 43453 transitions. [2025-01-09 14:47:14,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:47:14,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 427 [2025-01-09 14:47:14,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:14,993 INFO L225 Difference]: With dead ends: 27117 [2025-01-09 14:47:14,994 INFO L226 Difference]: Without dead ends: 18217 [2025-01-09 14:47:15,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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:47:15,023 INFO L435 NwaCegarLoop]: 678 mSDtfsCounter, 768 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 1795 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:15,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 1795 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:47:15,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18217 states. [2025-01-09 14:47:15,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18217 to 12721. [2025-01-09 14:47:15,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12721 states, 11655 states have (on average 1.5708279708279709) internal successors, (18308), 11671 states have internal predecessors, (18308), 1029 states have call successors, (1029), 36 states have call predecessors, (1029), 36 states have return successors, (1029), 1013 states have call predecessors, (1029), 1029 states have call successors, (1029) [2025-01-09 14:47:15,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12721 states to 12721 states and 20366 transitions. [2025-01-09 14:47:16,000 INFO L78 Accepts]: Start accepts. Automaton has 12721 states and 20366 transitions. Word has length 427 [2025-01-09 14:47:16,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:16,001 INFO L471 AbstractCegarLoop]: Abstraction has 12721 states and 20366 transitions. [2025-01-09 14:47:16,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:47:16,002 INFO L276 IsEmpty]: Start isEmpty. Operand 12721 states and 20366 transitions. [2025-01-09 14:47:16,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2025-01-09 14:47:16,015 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:16,016 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:16,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:47:16,016 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:16,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:16,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1107271946, now seen corresponding path program 1 times [2025-01-09 14:47:16,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:16,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411535174] [2025-01-09 14:47:16,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:16,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:16,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-01-09 14:47:16,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-01-09 14:47:16,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:16,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:16,546 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 14:47:16,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:16,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411535174] [2025-01-09 14:47:16,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411535174] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:16,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:16,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:16,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804902953] [2025-01-09 14:47:16,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:16,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:16,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:16,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:16,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:16,550 INFO L87 Difference]: Start difference. First operand 12721 states and 20366 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:47:17,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:17,696 INFO L93 Difference]: Finished difference Result 30294 states and 48440 transitions. [2025-01-09 14:47:17,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:17,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 427 [2025-01-09 14:47:17,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:17,765 INFO L225 Difference]: With dead ends: 30294 [2025-01-09 14:47:17,765 INFO L226 Difference]: Without dead ends: 20234 [2025-01-09 14:47:17,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:17,784 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 271 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:17,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 930 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:47:17,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20234 states. [2025-01-09 14:47:18,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20234 to 20232. [2025-01-09 14:47:18,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20232 states, 18166 states have (on average 1.5554332269074094) internal successors, (28256), 18198 states have internal predecessors, (28256), 1997 states have call successors, (1997), 68 states have call predecessors, (1997), 68 states have return successors, (1997), 1965 states have call predecessors, (1997), 1997 states have call successors, (1997) [2025-01-09 14:47:19,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20232 states to 20232 states and 32250 transitions. [2025-01-09 14:47:19,047 INFO L78 Accepts]: Start accepts. Automaton has 20232 states and 32250 transitions. Word has length 427 [2025-01-09 14:47:19,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:19,048 INFO L471 AbstractCegarLoop]: Abstraction has 20232 states and 32250 transitions. [2025-01-09 14:47:19,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:47:19,048 INFO L276 IsEmpty]: Start isEmpty. Operand 20232 states and 32250 transitions. [2025-01-09 14:47:19,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2025-01-09 14:47:19,061 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:19,061 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:19,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:47:19,062 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:19,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:19,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1530918668, now seen corresponding path program 1 times [2025-01-09 14:47:19,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:19,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555408438] [2025-01-09 14:47:19,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:19,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:19,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-01-09 14:47:20,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-01-09 14:47:20,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:20,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:20,443 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 30 proven. 150 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-01-09 14:47:20,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:20,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555408438] [2025-01-09 14:47:20,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555408438] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:47:20,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519382508] [2025-01-09 14:47:20,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:20,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:47:20,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:47:20,448 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:47:20,450 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:47:20,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-01-09 14:47:20,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-01-09 14:47:20,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:20,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:20,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 1120 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:47:20,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:47:21,055 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 1998 proven. 27 refuted. 0 times theorem prover too weak. 5295 trivial. 0 not checked. [2025-01-09 14:47:21,056 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:47:21,373 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 153 proven. 27 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-01-09 14:47:21,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519382508] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:47:21,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:47:21,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-09 14:47:21,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314567116] [2025-01-09 14:47:21,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:47:21,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:47:21,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:21,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:47:21,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:47:21,380 INFO L87 Difference]: Start difference. First operand 20232 states and 32250 transitions. Second operand has 8 states, 8 states have (on average 27.625) internal successors, (221), 8 states have internal predecessors, (221), 3 states have call successors, (120), 2 states have call predecessors, (120), 4 states have return successors, (122), 3 states have call predecessors, (122), 3 states have call successors, (122) [2025-01-09 14:47:23,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:23,644 INFO L93 Difference]: Finished difference Result 32950 states and 52057 transitions. [2025-01-09 14:47:23,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 14:47:23,644 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 27.625) internal successors, (221), 8 states have internal predecessors, (221), 3 states have call successors, (120), 2 states have call predecessors, (120), 4 states have return successors, (122), 3 states have call predecessors, (122), 3 states have call successors, (122) Word has length 427 [2025-01-09 14:47:23,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:23,708 INFO L225 Difference]: With dead ends: 32950 [2025-01-09 14:47:23,708 INFO L226 Difference]: Without dead ends: 14451 [2025-01-09 14:47:23,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 867 GetRequests, 851 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:47:23,741 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 809 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:23,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 1050 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 14:47:23,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14451 states. [2025-01-09 14:47:25,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14451 to 14315. [2025-01-09 14:47:25,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14315 states, 12183 states have (on average 1.4998768776163507) internal successors, (18273), 12215 states have internal predecessors, (18273), 1997 states have call successors, (1997), 134 states have call predecessors, (1997), 134 states have return successors, (1997), 1965 states have call predecessors, (1997), 1997 states have call successors, (1997) [2025-01-09 14:47:25,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14315 states to 14315 states and 22267 transitions. [2025-01-09 14:47:25,079 INFO L78 Accepts]: Start accepts. Automaton has 14315 states and 22267 transitions. Word has length 427 [2025-01-09 14:47:25,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:25,080 INFO L471 AbstractCegarLoop]: Abstraction has 14315 states and 22267 transitions. [2025-01-09 14:47:25,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.625) internal successors, (221), 8 states have internal predecessors, (221), 3 states have call successors, (120), 2 states have call predecessors, (120), 4 states have return successors, (122), 3 states have call predecessors, (122), 3 states have call successors, (122) [2025-01-09 14:47:25,080 INFO L276 IsEmpty]: Start isEmpty. Operand 14315 states and 22267 transitions. [2025-01-09 14:47:25,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-01-09 14:47:25,092 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:25,092 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:25,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 14:47:25,293 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,SelfDestructingSolverStorable13 [2025-01-09 14:47:25,293 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:25,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:25,294 INFO L85 PathProgramCache]: Analyzing trace with hash -183443562, now seen corresponding path program 1 times [2025-01-09 14:47:25,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:25,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676682495] [2025-01-09 14:47:25,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:25,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:25,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-01-09 14:47:25,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-01-09 14:47:25,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:25,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:26,241 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 14:47:26,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:26,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676682495] [2025-01-09 14:47:26,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676682495] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:26,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:26,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:47:26,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957156136] [2025-01-09 14:47:26,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:26,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:47:26,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:26,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:47:26,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:47:26,243 INFO L87 Difference]: Start difference. First operand 14315 states and 22267 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:47:27,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:27,243 INFO L93 Difference]: Finished difference Result 19931 states and 30999 transitions. [2025-01-09 14:47:27,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:47:27,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 429 [2025-01-09 14:47:27,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:27,280 INFO L225 Difference]: With dead ends: 19931 [2025-01-09 14:47:27,281 INFO L226 Difference]: Without dead ends: 6172 [2025-01-09 14:47:27,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:47:27,306 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 564 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:27,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 969 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:47:27,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6172 states. [2025-01-09 14:47:27,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6172 to 6172. [2025-01-09 14:47:27,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6172 states, 5072 states have (on average 1.4526813880126184) internal successors, (7368), 5088 states have internal predecessors, (7368), 1029 states have call successors, (1029), 70 states have call predecessors, (1029), 70 states have return successors, (1029), 1013 states have call predecessors, (1029), 1029 states have call successors, (1029) [2025-01-09 14:47:27,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6172 states to 6172 states and 9426 transitions. [2025-01-09 14:47:27,958 INFO L78 Accepts]: Start accepts. Automaton has 6172 states and 9426 transitions. Word has length 429 [2025-01-09 14:47:27,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:27,958 INFO L471 AbstractCegarLoop]: Abstraction has 6172 states and 9426 transitions. [2025-01-09 14:47:27,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:47:27,959 INFO L276 IsEmpty]: Start isEmpty. Operand 6172 states and 9426 transitions. [2025-01-09 14:47:27,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-01-09 14:47:27,964 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:27,964 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:27,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 14:47:27,964 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:27,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:27,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1625129901, now seen corresponding path program 1 times [2025-01-09 14:47:27,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:27,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305668533] [2025-01-09 14:47:27,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:27,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:27,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-01-09 14:47:28,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-01-09 14:47:28,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:28,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:29,305 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 60 proven. 120 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-01-09 14:47:29,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:29,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305668533] [2025-01-09 14:47:29,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305668533] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:47:29,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098670313] [2025-01-09 14:47:29,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:29,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:47:29,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:47:29,308 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:47:29,311 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:47:29,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-01-09 14:47:29,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-01-09 14:47:29,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:29,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:29,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 1124 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:47:29,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:47:29,926 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 2850 proven. 45 refuted. 0 times theorem prover too weak. 4425 trivial. 0 not checked. [2025-01-09 14:47:29,926 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:47:30,280 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 135 proven. 45 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-01-09 14:47:30,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098670313] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:47:30,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:47:30,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-01-09 14:47:30,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739491738] [2025-01-09 14:47:30,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:47:30,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:47:30,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:30,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:47:30,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:47:30,285 INFO L87 Difference]: Start difference. First operand 6172 states and 9426 transitions. Second operand has 9 states, 9 states have (on average 27.77777777777778) internal successors, (250), 9 states have internal predecessors, (250), 4 states have call successors, (137), 2 states have call predecessors, (137), 4 states have return successors, (138), 4 states have call predecessors, (138), 4 states have call successors, (138) [2025-01-09 14:47:31,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:31,976 INFO L93 Difference]: Finished difference Result 12256 states and 18613 transitions. [2025-01-09 14:47:31,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 14:47:31,976 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 27.77777777777778) internal successors, (250), 9 states have internal predecessors, (250), 4 states have call successors, (137), 2 states have call predecessors, (137), 4 states have return successors, (138), 4 states have call predecessors, (138), 4 states have call successors, (138) Word has length 430 [2025-01-09 14:47:31,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:32,007 INFO L225 Difference]: With dead ends: 12256 [2025-01-09 14:47:32,007 INFO L226 Difference]: Without dead ends: 6304 [2025-01-09 14:47:32,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 881 GetRequests, 859 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2025-01-09 14:47:32,023 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 1548 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 546 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1592 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 546 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:32,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1592 Valid, 1491 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [546 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 14:47:32,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6304 states. [2025-01-09 14:47:32,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6304 to 6208. [2025-01-09 14:47:32,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6208 states, 5090 states have (on average 1.4347740667976425) internal successors, (7303), 5106 states have internal predecessors, (7303), 1029 states have call successors, (1029), 88 states have call predecessors, (1029), 88 states have return successors, (1029), 1013 states have call predecessors, (1029), 1029 states have call successors, (1029) [2025-01-09 14:47:32,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6208 states to 6208 states and 9361 transitions. [2025-01-09 14:47:32,859 INFO L78 Accepts]: Start accepts. Automaton has 6208 states and 9361 transitions. Word has length 430 [2025-01-09 14:47:32,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:32,860 INFO L471 AbstractCegarLoop]: Abstraction has 6208 states and 9361 transitions. [2025-01-09 14:47:32,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.77777777777778) internal successors, (250), 9 states have internal predecessors, (250), 4 states have call successors, (137), 2 states have call predecessors, (137), 4 states have return successors, (138), 4 states have call predecessors, (138), 4 states have call successors, (138) [2025-01-09 14:47:32,860 INFO L276 IsEmpty]: Start isEmpty. Operand 6208 states and 9361 transitions. [2025-01-09 14:47:32,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2025-01-09 14:47:32,866 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:32,867 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:32,878 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:47:33,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 14:47:33,068 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:33,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:33,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1206973189, now seen corresponding path program 1 times [2025-01-09 14:47:33,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:33,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541374484] [2025-01-09 14:47:33,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:33,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:33,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-01-09 14:47:34,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-01-09 14:47:34,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:34,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:34,882 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 111 proven. 243 refuted. 0 times theorem prover too weak. 6966 trivial. 0 not checked. [2025-01-09 14:47:34,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:34,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541374484] [2025-01-09 14:47:34,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541374484] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:47:34,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968958284] [2025-01-09 14:47:34,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:34,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:47:34,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:47:34,887 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:47:34,889 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:47:35,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-01-09 14:47:35,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-01-09 14:47:35,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:35,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:35,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 1128 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 14:47:35,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:47:37,015 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 3258 proven. 468 refuted. 0 times theorem prover too weak. 3594 trivial. 0 not checked. [2025-01-09 14:47:37,015 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:47:37,996 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 216 proven. 486 refuted. 0 times theorem prover too weak. 6618 trivial. 0 not checked. [2025-01-09 14:47:37,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968958284] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:47:37,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:47:37,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 35 [2025-01-09 14:47:37,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110299600] [2025-01-09 14:47:37,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:47:37,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-09 14:47:37,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:37,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-09 14:47:38,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=933, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 14:47:38,001 INFO L87 Difference]: Start difference. First operand 6208 states and 9361 transitions. Second operand has 35 states, 31 states have (on average 9.451612903225806) internal successors, (293), 30 states have internal predecessors, (293), 13 states have call successors, (146), 5 states have call predecessors, (146), 10 states have return successors, (147), 11 states have call predecessors, (147), 13 states have call successors, (147) [2025-01-09 14:47:40,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:40,906 INFO L93 Difference]: Finished difference Result 12197 states and 18160 transitions. [2025-01-09 14:47:40,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-01-09 14:47:40,907 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 31 states have (on average 9.451612903225806) internal successors, (293), 30 states have internal predecessors, (293), 13 states have call successors, (146), 5 states have call predecessors, (146), 10 states have return successors, (147), 11 states have call predecessors, (147), 13 states have call successors, (147) Word has length 431 [2025-01-09 14:47:40,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:40,934 INFO L225 Difference]: With dead ends: 12197 [2025-01-09 14:47:40,934 INFO L226 Difference]: Without dead ends: 6598 [2025-01-09 14:47:40,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 918 GetRequests, 846 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1257 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1420, Invalid=3982, Unknown=0, NotChecked=0, Total=5402 [2025-01-09 14:47:40,948 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 2860 mSDsluCounter, 1632 mSDsCounter, 0 mSdLazyCounter, 1705 mSolverCounterSat, 767 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2860 SdHoareTripleChecker+Valid, 2078 SdHoareTripleChecker+Invalid, 2472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 767 IncrementalHoareTripleChecker+Valid, 1705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:40,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2860 Valid, 2078 Invalid, 2472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [767 Valid, 1705 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 14:47:40,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6598 states. [2025-01-09 14:47:41,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6598 to 6420. [2025-01-09 14:47:41,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6420 states, 5259 states have (on average 1.4105343221144704) internal successors, (7418), 5275 states have internal predecessors, (7418), 1013 states have call successors, (1013), 147 states have call predecessors, (1013), 147 states have return successors, (1013), 997 states have call predecessors, (1013), 1013 states have call successors, (1013) [2025-01-09 14:47:41,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6420 states to 6420 states and 9444 transitions. [2025-01-09 14:47:41,636 INFO L78 Accepts]: Start accepts. Automaton has 6420 states and 9444 transitions. Word has length 431 [2025-01-09 14:47:41,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:41,637 INFO L471 AbstractCegarLoop]: Abstraction has 6420 states and 9444 transitions. [2025-01-09 14:47:41,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 31 states have (on average 9.451612903225806) internal successors, (293), 30 states have internal predecessors, (293), 13 states have call successors, (146), 5 states have call predecessors, (146), 10 states have return successors, (147), 11 states have call predecessors, (147), 13 states have call successors, (147) [2025-01-09 14:47:41,637 INFO L276 IsEmpty]: Start isEmpty. Operand 6420 states and 9444 transitions. [2025-01-09 14:47:41,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2025-01-09 14:47:41,641 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:41,641 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:41,654 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:47:41,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:47:41,842 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:41,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:41,843 INFO L85 PathProgramCache]: Analyzing trace with hash -2104366467, now seen corresponding path program 1 times [2025-01-09 14:47:41,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:41,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565358332] [2025-01-09 14:47:41,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:41,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:41,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-01-09 14:47:42,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-01-09 14:47:42,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:42,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat