./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-70.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_amount250_file-70.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 e475a390090db67ea94556c3e569cedc1b507adccd423442184dd541c13b6194 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:27:17,659 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:27:17,719 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:27:17,723 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:27:17,725 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:27:17,748 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:27:17,749 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:27:17,749 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:27:17,749 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:27:17,749 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:27:17,750 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:27:17,750 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:27:17,750 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:27:17,750 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:27:17,750 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:27:17,750 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:27:17,751 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:27:17,751 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:27:17,751 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:27:17,751 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:27:17,752 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:27:17,752 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:27:17,752 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:27:17,752 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:27:17,752 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:27:17,752 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:27:17,752 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:27:17,752 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:27:17,752 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:27:17,752 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:27:17,752 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:27:17,752 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:27:17,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:27:17,753 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:27:17,753 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:27:17,753 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:27:17,753 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:27:17,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:27:17,753 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:27:17,753 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:27:17,753 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:27:17,753 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:27:17,753 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:27:17,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:27:17,754 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:27:17,754 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:27:17,754 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:27:17,754 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:27:17,754 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 -> e475a390090db67ea94556c3e569cedc1b507adccd423442184dd541c13b6194 [2025-01-09 14:27:17,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:27:17,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:27:17,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:27:17,983 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:27:17,984 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:27:17,984 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-70.i [2025-01-09 14:27:19,133 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/463103f66/50289147e86a4b40b57d19aa5ba6796c/FLAG9ee14d76e [2025-01-09 14:27:19,360 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:27:19,360 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-70.i [2025-01-09 14:27:19,368 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/463103f66/50289147e86a4b40b57d19aa5ba6796c/FLAG9ee14d76e [2025-01-09 14:27:19,688 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/463103f66/50289147e86a4b40b57d19aa5ba6796c [2025-01-09 14:27:19,690 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:27:19,691 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:27:19,692 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:27:19,692 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:27:19,695 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:27:19,696 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:27:19" (1/1) ... [2025-01-09 14:27:19,696 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33211a5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:27:19, skipping insertion in model container [2025-01-09 14:27:19,697 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:27:19" (1/1) ... [2025-01-09 14:27:19,725 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:27:19,830 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_amount250_file-70.i[916,929] [2025-01-09 14:27:19,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:27:19,984 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:27:19,994 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_amount250_file-70.i[916,929] [2025-01-09 14:27:20,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:27:20,059 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:27:20,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:27:20 WrapperNode [2025-01-09 14:27:20,060 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:27:20,061 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:27:20,062 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:27:20,062 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:27:20,065 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:27:20" (1/1) ... [2025-01-09 14:27:20,077 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:27:20" (1/1) ... [2025-01-09 14:27:20,119 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 474 [2025-01-09 14:27:20,119 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:27:20,120 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:27:20,120 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:27:20,120 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:27:20,126 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:27:20" (1/1) ... [2025-01-09 14:27:20,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:27:20" (1/1) ... [2025-01-09 14:27:20,139 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:27:20" (1/1) ... [2025-01-09 14:27:20,170 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:27:20,170 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:27:20" (1/1) ... [2025-01-09 14:27:20,170 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:27:20" (1/1) ... [2025-01-09 14:27:20,197 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:27:20" (1/1) ... [2025-01-09 14:27:20,200 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:27:20" (1/1) ... [2025-01-09 14:27:20,209 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:27:20" (1/1) ... [2025-01-09 14:27:20,220 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:27:20" (1/1) ... [2025-01-09 14:27:20,227 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:27:20" (1/1) ... [2025-01-09 14:27:20,238 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:27:20,240 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:27:20,240 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:27:20,240 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:27:20,241 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:27:20" (1/1) ... [2025-01-09 14:27:20,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:27:20,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:27:20,265 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:27:20,268 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:27:20,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:27:20,285 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:27:20,285 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:27:20,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:27:20,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:27:20,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:27:20,375 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:27:20,377 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:27:21,053 INFO L? ?]: Removed 68 outVars from TransFormulas that were not future-live. [2025-01-09 14:27:21,053 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:27:21,061 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:27:21,061 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:27:21,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:27:21 BoogieIcfgContainer [2025-01-09 14:27:21,062 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:27:21,064 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:27:21,064 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:27:21,067 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:27:21,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:27:19" (1/3) ... [2025-01-09 14:27:21,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b37674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:27:21, skipping insertion in model container [2025-01-09 14:27:21,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:27:20" (2/3) ... [2025-01-09 14:27:21,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b37674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:27:21, skipping insertion in model container [2025-01-09 14:27:21,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:27:21" (3/3) ... [2025-01-09 14:27:21,069 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-70.i [2025-01-09 14:27:21,098 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:27:21,101 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-70.i that has 2 procedures, 185 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:27:21,151 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:27:21,161 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;@1ce8d9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:27:21,162 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:27:21,166 INFO L276 IsEmpty]: Start isEmpty. Operand has 185 states, 147 states have (on average 1.530612244897959) internal successors, (225), 148 states have internal predecessors, (225), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-01-09 14:27:21,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-01-09 14:27:21,178 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:21,179 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:21,179 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:21,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:21,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1298551704, now seen corresponding path program 1 times [2025-01-09 14:27:21,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:21,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878339535] [2025-01-09 14:27:21,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:21,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:21,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-01-09 14:27:21,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-01-09 14:27:21,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:21,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:21,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2025-01-09 14:27:21,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:21,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878339535] [2025-01-09 14:27:21,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878339535] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:27:21,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046155537] [2025-01-09 14:27:21,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:21,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:27:21,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:27:21,588 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:27:21,590 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:27:21,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-01-09 14:27:21,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-01-09 14:27:21,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:21,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:21,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:27:21,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:27:21,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2025-01-09 14:27:21,864 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:27:21,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046155537] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:27:21,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:27:21,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:27:21,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246793923] [2025-01-09 14:27:21,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:27:21,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:27:21,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:21,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:27:21,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:27:21,887 INFO L87 Difference]: Start difference. First operand has 185 states, 147 states have (on average 1.530612244897959) internal successors, (225), 148 states have internal predecessors, (225), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2025-01-09 14:27:21,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:21,913 INFO L93 Difference]: Finished difference Result 364 states and 620 transitions. [2025-01-09 14:27:21,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:27:21,915 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) Word has length 247 [2025-01-09 14:27:21,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:21,921 INFO L225 Difference]: With dead ends: 364 [2025-01-09 14:27:21,921 INFO L226 Difference]: Without dead ends: 182 [2025-01-09 14:27:21,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:27:21,927 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:21,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:27:21,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-01-09 14:27:21,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2025-01-09 14:27:21,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 145 states have (on average 1.5172413793103448) internal successors, (220), 145 states have internal predecessors, (220), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-01-09 14:27:21,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 290 transitions. [2025-01-09 14:27:21,965 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 290 transitions. Word has length 247 [2025-01-09 14:27:21,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:21,965 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 290 transitions. [2025-01-09 14:27:21,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2025-01-09 14:27:21,966 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 290 transitions. [2025-01-09 14:27:21,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-01-09 14:27:21,970 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:21,970 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:21,978 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:27:22,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 14:27:22,175 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:22,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:22,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1969059154, now seen corresponding path program 1 times [2025-01-09 14:27:22,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:22,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402176335] [2025-01-09 14:27:22,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:22,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:22,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-01-09 14:27:22,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-01-09 14:27:22,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:22,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:22,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-01-09 14:27:22,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:22,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402176335] [2025-01-09 14:27:22,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402176335] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:27:22,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:27:22,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:27:22,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339939638] [2025-01-09 14:27:22,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:27:22,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:27:22,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:22,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:27:22,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:27:22,507 INFO L87 Difference]: Start difference. First operand 182 states and 290 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 14:27:22,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:22,588 INFO L93 Difference]: Finished difference Result 520 states and 831 transitions. [2025-01-09 14:27:22,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:27:22,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 247 [2025-01-09 14:27:22,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:22,592 INFO L225 Difference]: With dead ends: 520 [2025-01-09 14:27:22,592 INFO L226 Difference]: Without dead ends: 341 [2025-01-09 14:27:22,594 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:27:22,594 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 241 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:22,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 563 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:27:22,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-01-09 14:27:22,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 338. [2025-01-09 14:27:22,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 276 states have (on average 1.5326086956521738) internal successors, (423), 277 states have internal predecessors, (423), 59 states have call successors, (59), 2 states have call predecessors, (59), 2 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-01-09 14:27:22,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 541 transitions. [2025-01-09 14:27:22,637 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 541 transitions. Word has length 247 [2025-01-09 14:27:22,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:22,637 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 541 transitions. [2025-01-09 14:27:22,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 14:27:22,638 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 541 transitions. [2025-01-09 14:27:22,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-01-09 14:27:22,641 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:22,641 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:22,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:27:22,642 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:22,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:22,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1991691408, now seen corresponding path program 1 times [2025-01-09 14:27:22,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:22,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863246009] [2025-01-09 14:27:22,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:22,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:22,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-01-09 14:27:22,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-01-09 14:27:22,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:22,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:22,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-01-09 14:27:22,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:22,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863246009] [2025-01-09 14:27:22,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863246009] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:27:22,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:27:22,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:27:22,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303437335] [2025-01-09 14:27:22,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:27:22,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:27:22,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:22,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:27:22,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:27:22,838 INFO L87 Difference]: Start difference. First operand 338 states and 541 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 14:27:22,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:22,914 INFO L93 Difference]: Finished difference Result 937 states and 1494 transitions. [2025-01-09 14:27:22,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:27:22,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 247 [2025-01-09 14:27:22,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:22,923 INFO L225 Difference]: With dead ends: 937 [2025-01-09 14:27:22,923 INFO L226 Difference]: Without dead ends: 602 [2025-01-09 14:27:22,925 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:27:22,927 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 219 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:22,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 654 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:27:22,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2025-01-09 14:27:22,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 364. [2025-01-09 14:27:22,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 302 states have (on average 1.5397350993377483) internal successors, (465), 303 states have internal predecessors, (465), 59 states have call successors, (59), 2 states have call predecessors, (59), 2 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-01-09 14:27:22,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 583 transitions. [2025-01-09 14:27:22,971 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 583 transitions. Word has length 247 [2025-01-09 14:27:22,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:22,972 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 583 transitions. [2025-01-09 14:27:22,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 14:27:22,972 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 583 transitions. [2025-01-09 14:27:22,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-01-09 14:27:22,975 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:22,976 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:22,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:27:22,976 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:22,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:22,977 INFO L85 PathProgramCache]: Analyzing trace with hash 52239568, now seen corresponding path program 1 times [2025-01-09 14:27:22,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:22,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445799373] [2025-01-09 14:27:22,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:22,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:23,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-01-09 14:27:23,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-01-09 14:27:23,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:23,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:23,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-01-09 14:27:23,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:23,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445799373] [2025-01-09 14:27:23,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445799373] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:27:23,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:27:23,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:27:23,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18261136] [2025-01-09 14:27:23,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:27:23,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:27:23,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:23,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:27:23,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:27:23,202 INFO L87 Difference]: Start difference. First operand 364 states and 583 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 14:27:23,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:23,274 INFO L93 Difference]: Finished difference Result 970 states and 1547 transitions. [2025-01-09 14:27:23,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:27:23,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 247 [2025-01-09 14:27:23,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:23,279 INFO L225 Difference]: With dead ends: 970 [2025-01-09 14:27:23,282 INFO L226 Difference]: Without dead ends: 609 [2025-01-09 14:27:23,284 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:27:23,285 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 228 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:23,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 570 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:27:23,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2025-01-09 14:27:23,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 468. [2025-01-09 14:27:23,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 406 states have (on average 1.541871921182266) internal successors, (626), 407 states have internal predecessors, (626), 59 states have call successors, (59), 2 states have call predecessors, (59), 2 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-01-09 14:27:23,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 744 transitions. [2025-01-09 14:27:23,320 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 744 transitions. Word has length 247 [2025-01-09 14:27:23,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:23,323 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 744 transitions. [2025-01-09 14:27:23,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 14:27:23,323 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 744 transitions. [2025-01-09 14:27:23,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-01-09 14:27:23,326 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:23,326 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:23,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:27:23,326 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:23,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:23,327 INFO L85 PathProgramCache]: Analyzing trace with hash 753839442, now seen corresponding path program 1 times [2025-01-09 14:27:23,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:23,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220505658] [2025-01-09 14:27:23,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:23,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:23,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-01-09 14:27:23,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-01-09 14:27:23,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:23,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:23,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-01-09 14:27:23,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:23,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220505658] [2025-01-09 14:27:23,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220505658] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:27:23,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:27:23,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:27:23,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836225645] [2025-01-09 14:27:23,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:27:23,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:27:23,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:23,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:27:23,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:27:23,495 INFO L87 Difference]: Start difference. First operand 468 states and 744 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 14:27:23,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:23,576 INFO L93 Difference]: Finished difference Result 1392 states and 2214 transitions. [2025-01-09 14:27:23,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:27:23,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 247 [2025-01-09 14:27:23,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:23,584 INFO L225 Difference]: With dead ends: 1392 [2025-01-09 14:27:23,584 INFO L226 Difference]: Without dead ends: 927 [2025-01-09 14:27:23,586 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:27:23,588 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 261 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:23,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 783 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:27:23,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2025-01-09 14:27:23,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 656. [2025-01-09 14:27:23,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 594 states have (on average 1.5521885521885521) internal successors, (922), 595 states have internal predecessors, (922), 59 states have call successors, (59), 2 states have call predecessors, (59), 2 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-01-09 14:27:23,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1040 transitions. [2025-01-09 14:27:23,632 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1040 transitions. Word has length 247 [2025-01-09 14:27:23,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:23,633 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 1040 transitions. [2025-01-09 14:27:23,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 14:27:23,633 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1040 transitions. [2025-01-09 14:27:23,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-01-09 14:27:23,636 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:23,636 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:23,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:27:23,636 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:23,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:23,637 INFO L85 PathProgramCache]: Analyzing trace with hash 210950606, now seen corresponding path program 1 times [2025-01-09 14:27:23,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:23,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809536143] [2025-01-09 14:27:23,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:23,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:23,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-01-09 14:27:23,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-01-09 14:27:23,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:23,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:23,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-01-09 14:27:23,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:23,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809536143] [2025-01-09 14:27:23,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809536143] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:27:23,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:27:23,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:27:23,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802292796] [2025-01-09 14:27:23,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:27:23,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:27:23,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:23,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:27:23,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:27:23,912 INFO L87 Difference]: Start difference. First operand 656 states and 1040 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 14:27:24,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:24,123 INFO L93 Difference]: Finished difference Result 1924 states and 3052 transitions. [2025-01-09 14:27:24,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:27:24,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 247 [2025-01-09 14:27:24,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:24,131 INFO L225 Difference]: With dead ends: 1924 [2025-01-09 14:27:24,131 INFO L226 Difference]: Without dead ends: 1271 [2025-01-09 14:27:24,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:27:24,134 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 284 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:24,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 826 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:27:24,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2025-01-09 14:27:24,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1087. [2025-01-09 14:27:24,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1087 states, 988 states have (on average 1.5587044534412955) internal successors, (1540), 989 states have internal predecessors, (1540), 94 states have call successors, (94), 4 states have call predecessors, (94), 4 states have return successors, (94), 93 states have call predecessors, (94), 94 states have call successors, (94) [2025-01-09 14:27:24,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1728 transitions. [2025-01-09 14:27:24,177 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1728 transitions. Word has length 247 [2025-01-09 14:27:24,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:24,177 INFO L471 AbstractCegarLoop]: Abstraction has 1087 states and 1728 transitions. [2025-01-09 14:27:24,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 14:27:24,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1728 transitions. [2025-01-09 14:27:24,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-01-09 14:27:24,180 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:24,181 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:24,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:27:24,181 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:24,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:24,181 INFO L85 PathProgramCache]: Analyzing trace with hash -375855408, now seen corresponding path program 1 times [2025-01-09 14:27:24,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:24,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393129558] [2025-01-09 14:27:24,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:24,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:24,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-01-09 14:27:24,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-01-09 14:27:24,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:24,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:24,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-01-09 14:27:24,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:24,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393129558] [2025-01-09 14:27:24,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393129558] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:27:24,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:27:24,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 14:27:24,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723667918] [2025-01-09 14:27:24,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:27:24,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:27:24,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:24,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:27:24,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:27:24,757 INFO L87 Difference]: Start difference. First operand 1087 states and 1728 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-01-09 14:27:25,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:25,439 INFO L93 Difference]: Finished difference Result 4025 states and 6325 transitions. [2025-01-09 14:27:25,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 14:27:25,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 247 [2025-01-09 14:27:25,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:25,453 INFO L225 Difference]: With dead ends: 4025 [2025-01-09 14:27:25,453 INFO L226 Difference]: Without dead ends: 3232 [2025-01-09 14:27:25,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 14:27:25,457 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 1595 mSDsluCounter, 1432 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1595 SdHoareTripleChecker+Valid, 1825 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:25,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1595 Valid, 1825 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:27:25,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2025-01-09 14:27:25,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 2818. [2025-01-09 14:27:25,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2818 states, 2532 states have (on average 1.5363349131121642) internal successors, (3890), 2538 states have internal predecessors, (3890), 271 states have call successors, (271), 14 states have call predecessors, (271), 14 states have return successors, (271), 265 states have call predecessors, (271), 271 states have call successors, (271) [2025-01-09 14:27:25,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 4432 transitions. [2025-01-09 14:27:25,594 INFO L78 Accepts]: Start accepts. Automaton has 2818 states and 4432 transitions. Word has length 247 [2025-01-09 14:27:25,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:25,595 INFO L471 AbstractCegarLoop]: Abstraction has 2818 states and 4432 transitions. [2025-01-09 14:27:25,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-01-09 14:27:25,595 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 4432 transitions. [2025-01-09 14:27:25,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-01-09 14:27:25,600 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:25,601 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:25,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:27:25,601 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:25,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:25,601 INFO L85 PathProgramCache]: Analyzing trace with hash -313815794, now seen corresponding path program 1 times [2025-01-09 14:27:25,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:25,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734782945] [2025-01-09 14:27:25,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:25,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:25,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-01-09 14:27:25,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-01-09 14:27:25,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:25,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:26,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-01-09 14:27:26,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:26,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734782945] [2025-01-09 14:27:26,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734782945] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:27:26,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:27:26,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:27:26,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442320418] [2025-01-09 14:27:26,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:27:26,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:27:26,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:26,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:27:26,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:27:26,073 INFO L87 Difference]: Start difference. First operand 2818 states and 4432 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 14:27:26,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:26,437 INFO L93 Difference]: Finished difference Result 9625 states and 15217 transitions. [2025-01-09 14:27:26,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:27:26,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 247 [2025-01-09 14:27:26,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:26,466 INFO L225 Difference]: With dead ends: 9625 [2025-01-09 14:27:26,467 INFO L226 Difference]: Without dead ends: 6878 [2025-01-09 14:27:26,476 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:27:26,476 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 705 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:26,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 809 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:27:26,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6878 states. [2025-01-09 14:27:26,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6878 to 4564. [2025-01-09 14:27:26,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4564 states, 4093 states have (on average 1.5123381382848766) internal successors, (6190), 4103 states have internal predecessors, (6190), 448 states have call successors, (448), 22 states have call predecessors, (448), 22 states have return successors, (448), 438 states have call predecessors, (448), 448 states have call successors, (448) [2025-01-09 14:27:26,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4564 states to 4564 states and 7086 transitions. [2025-01-09 14:27:26,730 INFO L78 Accepts]: Start accepts. Automaton has 4564 states and 7086 transitions. Word has length 247 [2025-01-09 14:27:26,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:26,731 INFO L471 AbstractCegarLoop]: Abstraction has 4564 states and 7086 transitions. [2025-01-09 14:27:26,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 14:27:26,731 INFO L276 IsEmpty]: Start isEmpty. Operand 4564 states and 7086 transitions. [2025-01-09 14:27:26,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-01-09 14:27:26,738 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:26,738 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:26,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:27:26,738 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:26,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:26,739 INFO L85 PathProgramCache]: Analyzing trace with hash 579670544, now seen corresponding path program 1 times [2025-01-09 14:27:26,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:26,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055515914] [2025-01-09 14:27:26,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:26,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:26,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-01-09 14:27:26,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-01-09 14:27:26,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:26,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:27,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-01-09 14:27:27,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:27,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055515914] [2025-01-09 14:27:27,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055515914] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:27:27,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:27:27,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:27:27,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619890025] [2025-01-09 14:27:27,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:27:27,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:27:27,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:27,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:27:27,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:27:27,279 INFO L87 Difference]: Start difference. First operand 4564 states and 7086 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 14:27:27,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:27,727 INFO L93 Difference]: Finished difference Result 14339 states and 22285 transitions. [2025-01-09 14:27:27,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:27:27,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 247 [2025-01-09 14:27:27,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:27,771 INFO L225 Difference]: With dead ends: 14339 [2025-01-09 14:27:27,771 INFO L226 Difference]: Without dead ends: 10081 [2025-01-09 14:27:27,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:27:27,785 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 584 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 1450 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:27,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 1450 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:27:27,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10081 states. [2025-01-09 14:27:28,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10081 to 6792. [2025-01-09 14:27:28,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6792 states, 5888 states have (on average 1.4716372282608696) internal successors, (8665), 5908 states have internal predecessors, (8665), 861 states have call successors, (861), 42 states have call predecessors, (861), 42 states have return successors, (861), 841 states have call predecessors, (861), 861 states have call successors, (861) [2025-01-09 14:27:28,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6792 states to 6792 states and 10387 transitions. [2025-01-09 14:27:28,118 INFO L78 Accepts]: Start accepts. Automaton has 6792 states and 10387 transitions. Word has length 247 [2025-01-09 14:27:28,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:28,118 INFO L471 AbstractCegarLoop]: Abstraction has 6792 states and 10387 transitions. [2025-01-09 14:27:28,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-01-09 14:27:28,119 INFO L276 IsEmpty]: Start isEmpty. Operand 6792 states and 10387 transitions. [2025-01-09 14:27:28,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-01-09 14:27:28,124 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:28,124 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:28,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:27:28,124 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:28,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:28,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1693269578, now seen corresponding path program 1 times [2025-01-09 14:27:28,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:28,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483203750] [2025-01-09 14:27:28,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:28,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:28,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-01-09 14:27:28,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-01-09 14:27:28,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:28,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:28,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 3 proven. 99 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2025-01-09 14:27:28,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:28,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483203750] [2025-01-09 14:27:28,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483203750] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:27:28,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834649528] [2025-01-09 14:27:28,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:28,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:27:28,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:27:28,570 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:27:28,572 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:27:28,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-01-09 14:27:28,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-01-09 14:27:28,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:28,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:28,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:27:28,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:27:29,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 168 proven. 99 refuted. 0 times theorem prover too weak. 2113 trivial. 0 not checked. [2025-01-09 14:27:29,134 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:27:29,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 3 proven. 99 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2025-01-09 14:27:29,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834649528] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:27:29,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:27:29,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-09 14:27:29,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749603566] [2025-01-09 14:27:29,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:27:29,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:27:29,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:29,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:27:29,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:27:29,429 INFO L87 Difference]: Start difference. First operand 6792 states and 10387 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 3 states have call successors, (101), 2 states have call predecessors, (101), 4 states have return successors, (102), 3 states have call predecessors, (102), 3 states have call successors, (102) [2025-01-09 14:27:29,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:29,884 INFO L93 Difference]: Finished difference Result 13680 states and 20803 transitions. [2025-01-09 14:27:29,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:27:29,888 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 3 states have call successors, (101), 2 states have call predecessors, (101), 4 states have return successors, (102), 3 states have call predecessors, (102), 3 states have call successors, (102) Word has length 247 [2025-01-09 14:27:29,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:29,925 INFO L225 Difference]: With dead ends: 13680 [2025-01-09 14:27:29,925 INFO L226 Difference]: Without dead ends: 6968 [2025-01-09 14:27:29,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 491 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:27:29,941 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 188 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:29,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 621 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:27:29,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6968 states. [2025-01-09 14:27:30,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6968 to 6908. [2025-01-09 14:27:30,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6908 states, 5975 states have (on average 1.4460251046025105) internal successors, (8640), 5995 states have internal predecessors, (8640), 861 states have call successors, (861), 71 states have call predecessors, (861), 71 states have return successors, (861), 841 states have call predecessors, (861), 861 states have call successors, (861) [2025-01-09 14:27:30,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6908 states to 6908 states and 10362 transitions. [2025-01-09 14:27:30,340 INFO L78 Accepts]: Start accepts. Automaton has 6908 states and 10362 transitions. Word has length 247 [2025-01-09 14:27:30,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:30,342 INFO L471 AbstractCegarLoop]: Abstraction has 6908 states and 10362 transitions. [2025-01-09 14:27:30,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 3 states have call successors, (101), 2 states have call predecessors, (101), 4 states have return successors, (102), 3 states have call predecessors, (102), 3 states have call successors, (102) [2025-01-09 14:27:30,343 INFO L276 IsEmpty]: Start isEmpty. Operand 6908 states and 10362 transitions. [2025-01-09 14:27:30,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-01-09 14:27:30,348 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:30,348 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:30,356 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:27:30,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:27:30,549 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:30,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:30,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1757508153, now seen corresponding path program 1 times [2025-01-09 14:27:30,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:30,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574096682] [2025-01-09 14:27:30,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:30,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:30,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-01-09 14:27:30,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-01-09 14:27:30,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:30,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 14:27:30,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [198919021] [2025-01-09 14:27:30,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:30,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:27:30,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:27:30,968 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:27:31,010 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:27:31,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-01-09 14:27:31,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-01-09 14:27:31,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:31,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:31,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 14:27:31,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:27:33,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 597 proven. 255 refuted. 0 times theorem prover too weak. 1528 trivial. 0 not checked. [2025-01-09 14:27:33,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:27:34,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:34,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574096682] [2025-01-09 14:27:34,138 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 14:27:34,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198919021] [2025-01-09 14:27:34,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198919021] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:27:34,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:27:34,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2025-01-09 14:27:34,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441837793] [2025-01-09 14:27:34,138 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 14:27:34,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 14:27:34,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:34,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 14:27:34,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=424, Unknown=0, NotChecked=0, Total=600 [2025-01-09 14:27:34,140 INFO L87 Difference]: Start difference. First operand 6908 states and 10362 transitions. Second operand has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 11 states have internal predecessors, (92), 4 states have call successors, (35), 4 states have call predecessors, (35), 6 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) [2025-01-09 14:27:35,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:35,044 INFO L93 Difference]: Finished difference Result 21504 states and 32007 transitions. [2025-01-09 14:27:35,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 14:27:35,045 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 11 states have internal predecessors, (92), 4 states have call successors, (35), 4 states have call predecessors, (35), 6 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) Word has length 249 [2025-01-09 14:27:35,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:35,086 INFO L225 Difference]: With dead ends: 21504 [2025-01-09 14:27:35,086 INFO L226 Difference]: Without dead ends: 14906 [2025-01-09 14:27:35,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 448 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=524, Unknown=0, NotChecked=0, Total=756 [2025-01-09 14:27:35,100 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 232 mSDsluCounter, 1868 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 2245 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:35,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 2245 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:27:35,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14906 states. [2025-01-09 14:27:35,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14906 to 13900. [2025-01-09 14:27:35,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13900 states, 11974 states have (on average 1.426841489894772) internal successors, (17085), 12014 states have internal predecessors, (17085), 1687 states have call successors, (1687), 238 states have call predecessors, (1687), 238 states have return successors, (1687), 1647 states have call predecessors, (1687), 1687 states have call successors, (1687) [2025-01-09 14:27:35,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13900 states to 13900 states and 20459 transitions. [2025-01-09 14:27:35,656 INFO L78 Accepts]: Start accepts. Automaton has 13900 states and 20459 transitions. Word has length 249 [2025-01-09 14:27:35,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:35,656 INFO L471 AbstractCegarLoop]: Abstraction has 13900 states and 20459 transitions. [2025-01-09 14:27:35,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 11 states have internal predecessors, (92), 4 states have call successors, (35), 4 states have call predecessors, (35), 6 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) [2025-01-09 14:27:35,657 INFO L276 IsEmpty]: Start isEmpty. Operand 13900 states and 20459 transitions. [2025-01-09 14:27:35,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-01-09 14:27:35,663 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:35,663 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:35,671 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:27:35,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:27:35,868 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:35,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:35,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1892020839, now seen corresponding path program 1 times [2025-01-09 14:27:35,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:35,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476193895] [2025-01-09 14:27:35,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:35,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:35,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-01-09 14:27:36,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-01-09 14:27:36,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:36,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 14:27:36,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [475644407] [2025-01-09 14:27:36,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:36,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:27:36,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:27:36,157 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:27:36,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 14:27:36,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-01-09 14:27:36,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-01-09 14:27:36,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:36,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:36,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 14:27:36,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:27:46,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 662 proven. 402 refuted. 0 times theorem prover too weak. 1316 trivial. 0 not checked. [2025-01-09 14:27:46,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:27:55,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:55,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476193895] [2025-01-09 14:27:55,161 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 14:27:55,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475644407] [2025-01-09 14:27:55,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475644407] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:27:55,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:27:55,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2025-01-09 14:27:55,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338417944] [2025-01-09 14:27:55,161 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 14:27:55,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 14:27:55,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:55,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 14:27:55,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=668, Unknown=2, NotChecked=0, Total=812 [2025-01-09 14:27:55,163 INFO L87 Difference]: Start difference. First operand 13900 states and 20459 transitions. Second operand has 22 states, 22 states have (on average 4.5) internal successors, (99), 20 states have internal predecessors, (99), 6 states have call successors, (35), 6 states have call predecessors, (35), 8 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2025-01-09 14:28:00,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 14:28:04,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 14:28:08,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 14:28:12,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 14:28:16,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 14:28:20,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 14:28:25,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 14:28:29,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 14:28:33,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 14:28:37,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 14:28:41,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 14:28:45,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 14:28:49,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0]