./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-2.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 0f4d1a0f878f07f9b07af3368e16f27fe17adbf3f533e01dbd51821a170a1e65 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:44:31,284 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:44:31,340 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:44:31,345 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:44:31,345 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:44:31,361 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:44:31,362 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:44:31,362 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:44:31,363 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:44:31,363 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:44:31,364 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:44:31,364 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:44:31,365 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:44:31,365 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:44:31,365 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:44:31,366 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:44:31,366 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:44:31,366 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:44:31,366 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:44:31,366 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:44:31,366 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:44:31,366 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:44:31,366 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:44:31,366 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:44:31,366 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:44:31,366 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:44:31,366 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:44:31,366 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:44:31,366 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:44:31,366 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:44:31,366 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:44:31,366 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:44:31,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:44:31,366 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:44:31,366 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:44:31,366 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:44:31,366 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:44:31,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:44:31,367 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:44:31,367 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:44:31,367 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:44:31,367 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:44:31,367 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:44:31,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:44:31,367 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:44:31,367 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:44:31,367 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:44:31,367 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:44:31,367 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 -> 0f4d1a0f878f07f9b07af3368e16f27fe17adbf3f533e01dbd51821a170a1e65 [2025-01-09 14:44:31,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:44:31,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:44:31,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:44:31,597 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:44:31,597 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:44:31,598 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-2.i [2025-01-09 14:44:32,721 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f2c75b776/ab8a01d2e3ab4efb96a873078f25f94a/FLAGcdf8eb442 [2025-01-09 14:44:33,056 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:44:33,060 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-2.i [2025-01-09 14:44:33,077 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f2c75b776/ab8a01d2e3ab4efb96a873078f25f94a/FLAGcdf8eb442 [2025-01-09 14:44:33,314 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f2c75b776/ab8a01d2e3ab4efb96a873078f25f94a [2025-01-09 14:44:33,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:44:33,317 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:44:33,318 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:44:33,319 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:44:33,322 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:44:33,322 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:44:33" (1/1) ... [2025-01-09 14:44:33,323 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15a4481b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:33, skipping insertion in model container [2025-01-09 14:44:33,323 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:44:33" (1/1) ... [2025-01-09 14:44:33,351 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:44:33,471 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-2.i[915,928] [2025-01-09 14:44:33,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:44:33,676 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:44:33,690 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-2.i[915,928] [2025-01-09 14:44:33,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:44:33,807 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:44:33,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:33 WrapperNode [2025-01-09 14:44:33,810 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:44:33,811 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:44:33,812 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:44:33,812 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:44:33,816 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:44:33" (1/1) ... [2025-01-09 14:44:33,840 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:44:33" (1/1) ... [2025-01-09 14:44:33,911 INFO L138 Inliner]: procedures = 26, calls = 86, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 702 [2025-01-09 14:44:33,911 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:44:33,912 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:44:33,913 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:44:33,913 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:44:33,919 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:33" (1/1) ... [2025-01-09 14:44:33,920 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:33" (1/1) ... [2025-01-09 14:44:33,935 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:33" (1/1) ... [2025-01-09 14:44:33,979 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:44:33,980 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:33" (1/1) ... [2025-01-09 14:44:33,980 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:33" (1/1) ... [2025-01-09 14:44:34,009 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:33" (1/1) ... [2025-01-09 14:44:34,014 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:33" (1/1) ... [2025-01-09 14:44:34,021 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:33" (1/1) ... [2025-01-09 14:44:34,034 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:33" (1/1) ... [2025-01-09 14:44:34,045 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:33" (1/1) ... [2025-01-09 14:44:34,059 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:44:34,060 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:44:34,061 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:44:34,061 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:44:34,062 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:33" (1/1) ... [2025-01-09 14:44:34,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:44:34,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:44:34,089 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:44:34,117 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:44:34,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:44:34,138 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:44:34,138 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:44:34,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:44:34,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:44:34,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:44:34,263 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:44:34,265 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:44:35,283 INFO L? ?]: Removed 82 outVars from TransFormulas that were not future-live. [2025-01-09 14:44:35,284 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:44:35,300 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:44:35,303 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:44:35,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:44:35 BoogieIcfgContainer [2025-01-09 14:44:35,304 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:44:35,305 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:44:35,305 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:44:35,309 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:44:35,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:44:33" (1/3) ... [2025-01-09 14:44:35,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@507f2149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:44:35, skipping insertion in model container [2025-01-09 14:44:35,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:33" (2/3) ... [2025-01-09 14:44:35,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@507f2149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:44:35, skipping insertion in model container [2025-01-09 14:44:35,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:44:35" (3/3) ... [2025-01-09 14:44:35,311 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-2.i [2025-01-09 14:44:35,322 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:44:35,325 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-2.i that has 2 procedures, 279 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:44:35,380 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:44:35,389 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;@4156b8bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:44:35,390 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:44:35,396 INFO L276 IsEmpty]: Start isEmpty. Operand has 279 states, 203 states have (on average 1.5369458128078817) internal successors, (312), 204 states have internal predecessors, (312), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-01-09 14:44:35,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-01-09 14:44:35,419 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:35,420 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:35,420 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:35,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:35,425 INFO L85 PathProgramCache]: Analyzing trace with hash -887889160, now seen corresponding path program 1 times [2025-01-09 14:44:35,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:35,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120629478] [2025-01-09 14:44:35,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:35,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:35,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-01-09 14:44:35,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-01-09 14:44:35,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:35,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:35,956 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 10368 trivial. 0 not checked. [2025-01-09 14:44:35,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:35,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120629478] [2025-01-09 14:44:35,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120629478] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:44:35,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121120356] [2025-01-09 14:44:35,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:35,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:44:35,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:44:35,959 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:44:35,961 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:44:36,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-01-09 14:44:36,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-01-09 14:44:36,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:36,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:36,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 1216 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:44:36,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:44:36,351 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 10368 trivial. 0 not checked. [2025-01-09 14:44:36,352 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:44:36,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121120356] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:36,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:44:36,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:44:36,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400053363] [2025-01-09 14:44:36,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:36,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:44:36,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:36,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:44:36,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:44:36,378 INFO L87 Difference]: Start difference. First operand has 279 states, 203 states have (on average 1.5369458128078817) internal successors, (312), 204 states have internal predecessors, (312), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) Second operand has 2 states, 2 states have (on average 67.0) internal successors, (134), 2 states have internal predecessors, (134), 2 states have call successors, (73), 2 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 2 states have call successors, (73) [2025-01-09 14:44:36,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:36,416 INFO L93 Difference]: Finished difference Result 552 states and 984 transitions. [2025-01-09 14:44:36,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:44:36,417 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 67.0) internal successors, (134), 2 states have internal predecessors, (134), 2 states have call successors, (73), 2 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 2 states have call successors, (73) Word has length 494 [2025-01-09 14:44:36,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:36,426 INFO L225 Difference]: With dead ends: 552 [2025-01-09 14:44:36,427 INFO L226 Difference]: Without dead ends: 276 [2025-01-09 14:44:36,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 495 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:44:36,434 INFO L435 NwaCegarLoop]: 453 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, 453 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:44:36,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:44:36,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-01-09 14:44:36,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2025-01-09 14:44:36,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 201 states have (on average 1.527363184079602) internal successors, (307), 201 states have internal predecessors, (307), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-01-09 14:44:36,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 453 transitions. [2025-01-09 14:44:36,494 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 453 transitions. Word has length 494 [2025-01-09 14:44:36,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:36,494 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 453 transitions. [2025-01-09 14:44:36,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 67.0) internal successors, (134), 2 states have internal predecessors, (134), 2 states have call successors, (73), 2 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 2 states have call successors, (73) [2025-01-09 14:44:36,495 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 453 transitions. [2025-01-09 14:44:36,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-01-09 14:44:36,504 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:36,505 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:36,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 14:44:36,706 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:44:36,707 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:36,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:36,708 INFO L85 PathProgramCache]: Analyzing trace with hash 875228794, now seen corresponding path program 1 times [2025-01-09 14:44:36,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:36,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795157774] [2025-01-09 14:44:36,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:36,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:36,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-01-09 14:44:36,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-01-09 14:44:36,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:36,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:37,317 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-01-09 14:44:37,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:37,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795157774] [2025-01-09 14:44:37,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795157774] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:37,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:37,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:44:37,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745066359] [2025-01-09 14:44:37,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:37,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:44:37,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:37,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:44:37,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:44:37,327 INFO L87 Difference]: Start difference. First operand 276 states and 453 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 14:44:37,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:37,458 INFO L93 Difference]: Finished difference Result 807 states and 1327 transitions. [2025-01-09 14:44:37,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:44:37,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 494 [2025-01-09 14:44:37,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:37,467 INFO L225 Difference]: With dead ends: 807 [2025-01-09 14:44:37,467 INFO L226 Difference]: Without dead ends: 534 [2025-01-09 14:44:37,469 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:44:37,469 INFO L435 NwaCegarLoop]: 690 mSDtfsCounter, 436 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:37,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 1104 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:44:37,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-01-09 14:44:37,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 532. [2025-01-09 14:44:37,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 383 states have (on average 1.5195822454308094) internal successors, (582), 383 states have internal predecessors, (582), 146 states have call successors, (146), 2 states have call predecessors, (146), 2 states have return successors, (146), 146 states have call predecessors, (146), 146 states have call successors, (146) [2025-01-09 14:44:37,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 874 transitions. [2025-01-09 14:44:37,537 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 874 transitions. Word has length 494 [2025-01-09 14:44:37,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:37,538 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 874 transitions. [2025-01-09 14:44:37,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 14:44:37,538 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 874 transitions. [2025-01-09 14:44:37,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-01-09 14:44:37,548 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:37,549 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:37,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:44:37,549 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:37,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:37,550 INFO L85 PathProgramCache]: Analyzing trace with hash 890747512, now seen corresponding path program 1 times [2025-01-09 14:44:37,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:37,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775658756] [2025-01-09 14:44:37,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:37,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:37,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-01-09 14:44:38,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-01-09 14:44:38,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:38,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:39,048 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-01-09 14:44:39,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:39,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775658756] [2025-01-09 14:44:39,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775658756] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:39,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:39,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:44:39,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132317194] [2025-01-09 14:44:39,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:39,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:44:39,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:39,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:44:39,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:44:39,053 INFO L87 Difference]: Start difference. First operand 532 states and 874 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 14:44:39,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:39,447 INFO L93 Difference]: Finished difference Result 1479 states and 2436 transitions. [2025-01-09 14:44:39,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:44:39,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 494 [2025-01-09 14:44:39,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:39,454 INFO L225 Difference]: With dead ends: 1479 [2025-01-09 14:44:39,454 INFO L226 Difference]: Without dead ends: 950 [2025-01-09 14:44:39,456 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:44:39,457 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 372 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:39,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 1360 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:44:39,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2025-01-09 14:44:39,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 656. [2025-01-09 14:44:39,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 433 states have (on average 1.464203233256351) internal successors, (634), 433 states have internal predecessors, (634), 219 states have call successors, (219), 3 states have call predecessors, (219), 3 states have return successors, (219), 219 states have call predecessors, (219), 219 states have call successors, (219) [2025-01-09 14:44:39,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1072 transitions. [2025-01-09 14:44:39,536 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1072 transitions. Word has length 494 [2025-01-09 14:44:39,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:39,543 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 1072 transitions. [2025-01-09 14:44:39,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 14:44:39,543 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1072 transitions. [2025-01-09 14:44:39,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-01-09 14:44:39,549 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:39,549 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:39,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:44:39,549 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:39,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:39,550 INFO L85 PathProgramCache]: Analyzing trace with hash -422389056, now seen corresponding path program 1 times [2025-01-09 14:44:39,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:39,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219040375] [2025-01-09 14:44:39,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:39,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:39,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-01-09 14:44:40,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-01-09 14:44:40,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:40,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:40,861 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-01-09 14:44:40,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:40,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219040375] [2025-01-09 14:44:40,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219040375] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:40,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:40,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:44:40,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544354329] [2025-01-09 14:44:40,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:40,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:44:40,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:40,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:44:40,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:44:40,864 INFO L87 Difference]: Start difference. First operand 656 states and 1072 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 14:44:41,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:41,146 INFO L93 Difference]: Finished difference Result 1779 states and 2898 transitions. [2025-01-09 14:44:41,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:44:41,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 494 [2025-01-09 14:44:41,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:41,154 INFO L225 Difference]: With dead ends: 1779 [2025-01-09 14:44:41,154 INFO L226 Difference]: Without dead ends: 1250 [2025-01-09 14:44:41,156 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:44:41,157 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 658 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:41,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 1536 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:44:41,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2025-01-09 14:44:41,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 983. [2025-01-09 14:44:41,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 722 states have (on average 1.5083102493074791) internal successors, (1089), 724 states have internal predecessors, (1089), 255 states have call successors, (255), 5 states have call predecessors, (255), 5 states have return successors, (255), 253 states have call predecessors, (255), 255 states have call successors, (255) [2025-01-09 14:44:41,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1599 transitions. [2025-01-09 14:44:41,237 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1599 transitions. Word has length 494 [2025-01-09 14:44:41,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:41,238 INFO L471 AbstractCegarLoop]: Abstraction has 983 states and 1599 transitions. [2025-01-09 14:44:41,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 14:44:41,239 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1599 transitions. [2025-01-09 14:44:41,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-01-09 14:44:41,245 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:41,246 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:41,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:44:41,246 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:41,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:41,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1163684608, now seen corresponding path program 1 times [2025-01-09 14:44:41,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:41,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096123481] [2025-01-09 14:44:41,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:41,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:41,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-01-09 14:44:41,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-01-09 14:44:41,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:41,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:42,298 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-01-09 14:44:42,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:42,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096123481] [2025-01-09 14:44:42,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096123481] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:42,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:42,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:44:42,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165044812] [2025-01-09 14:44:42,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:42,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:44:42,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:42,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:44:42,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:44:42,302 INFO L87 Difference]: Start difference. First operand 983 states and 1599 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 14:44:42,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:42,665 INFO L93 Difference]: Finished difference Result 2651 states and 4250 transitions. [2025-01-09 14:44:42,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:44:42,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 494 [2025-01-09 14:44:42,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:42,678 INFO L225 Difference]: With dead ends: 2651 [2025-01-09 14:44:42,678 INFO L226 Difference]: Without dead ends: 1795 [2025-01-09 14:44:42,682 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:44:42,683 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 300 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:42,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 1398 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:44:42,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states. [2025-01-09 14:44:42,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1529. [2025-01-09 14:44:42,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1529 states, 1187 states have (on average 1.5181128896377423) internal successors, (1802), 1193 states have internal predecessors, (1802), 331 states have call successors, (331), 10 states have call predecessors, (331), 10 states have return successors, (331), 325 states have call predecessors, (331), 331 states have call successors, (331) [2025-01-09 14:44:42,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1529 states and 2464 transitions. [2025-01-09 14:44:42,779 INFO L78 Accepts]: Start accepts. Automaton has 1529 states and 2464 transitions. Word has length 494 [2025-01-09 14:44:42,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:42,781 INFO L471 AbstractCegarLoop]: Abstraction has 1529 states and 2464 transitions. [2025-01-09 14:44:42,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 14:44:42,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 2464 transitions. [2025-01-09 14:44:42,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-01-09 14:44:42,789 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:42,789 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:42,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:44:42,789 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:42,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:42,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1208054654, now seen corresponding path program 1 times [2025-01-09 14:44:42,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:42,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745260108] [2025-01-09 14:44:42,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:42,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:42,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-01-09 14:44:42,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-01-09 14:44:42,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:42,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:43,285 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-01-09 14:44:43,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:43,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745260108] [2025-01-09 14:44:43,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745260108] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:43,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:43,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:44:43,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475345135] [2025-01-09 14:44:43,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:43,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:44:43,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:43,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:44:43,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:44:43,291 INFO L87 Difference]: Start difference. First operand 1529 states and 2464 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 14:44:43,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:43,963 INFO L93 Difference]: Finished difference Result 4195 states and 6759 transitions. [2025-01-09 14:44:43,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:44:43,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 494 [2025-01-09 14:44:43,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:43,979 INFO L225 Difference]: With dead ends: 4195 [2025-01-09 14:44:43,979 INFO L226 Difference]: Without dead ends: 2797 [2025-01-09 14:44:43,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:44:43,984 INFO L435 NwaCegarLoop]: 758 mSDtfsCounter, 680 mSDsluCounter, 1333 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 2091 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:43,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 2091 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:44:43,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2797 states. [2025-01-09 14:44:44,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2797 to 2793. [2025-01-09 14:44:44,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2793 states, 2185 states have (on average 1.5116704805491992) internal successors, (3303), 2197 states have internal predecessors, (3303), 589 states have call successors, (589), 18 states have call predecessors, (589), 18 states have return successors, (589), 577 states have call predecessors, (589), 589 states have call successors, (589) [2025-01-09 14:44:44,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2793 states to 2793 states and 4481 transitions. [2025-01-09 14:44:44,145 INFO L78 Accepts]: Start accepts. Automaton has 2793 states and 4481 transitions. Word has length 494 [2025-01-09 14:44:44,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:44,146 INFO L471 AbstractCegarLoop]: Abstraction has 2793 states and 4481 transitions. [2025-01-09 14:44:44,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 14:44:44,147 INFO L276 IsEmpty]: Start isEmpty. Operand 2793 states and 4481 transitions. [2025-01-09 14:44:44,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-01-09 14:44:44,151 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:44,151 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:44,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:44:44,152 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:44,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:44,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1021749438, now seen corresponding path program 1 times [2025-01-09 14:44:44,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:44,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175248909] [2025-01-09 14:44:44,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:44,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:44,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-01-09 14:44:44,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-01-09 14:44:44,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:44,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:45,255 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-01-09 14:44:45,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:45,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175248909] [2025-01-09 14:44:45,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175248909] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:45,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:45,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:44:45,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259953005] [2025-01-09 14:44:45,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:45,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:44:45,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:45,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:44:45,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:44:45,260 INFO L87 Difference]: Start difference. First operand 2793 states and 4481 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 14:44:46,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:46,250 INFO L93 Difference]: Finished difference Result 10581 states and 16855 transitions. [2025-01-09 14:44:46,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:44:46,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 494 [2025-01-09 14:44:46,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:46,287 INFO L225 Difference]: With dead ends: 10581 [2025-01-09 14:44:46,287 INFO L226 Difference]: Without dead ends: 7919 [2025-01-09 14:44:46,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:44:46,296 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 879 mSDsluCounter, 1561 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 2264 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:46,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 2264 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 14:44:46,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7919 states. [2025-01-09 14:44:46,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7919 to 3365. [2025-01-09 14:44:46,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3365 states, 2757 states have (on average 1.5375408052230686) internal successors, (4239), 2769 states have internal predecessors, (4239), 589 states have call successors, (589), 18 states have call predecessors, (589), 18 states have return successors, (589), 577 states have call predecessors, (589), 589 states have call successors, (589) [2025-01-09 14:44:46,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3365 states to 3365 states and 5417 transitions. [2025-01-09 14:44:46,544 INFO L78 Accepts]: Start accepts. Automaton has 3365 states and 5417 transitions. Word has length 494 [2025-01-09 14:44:46,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:46,545 INFO L471 AbstractCegarLoop]: Abstraction has 3365 states and 5417 transitions. [2025-01-09 14:44:46,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 14:44:46,545 INFO L276 IsEmpty]: Start isEmpty. Operand 3365 states and 5417 transitions. [2025-01-09 14:44:46,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-01-09 14:44:46,550 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:46,550 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:46,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:44:46,550 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:46,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:46,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1993354180, now seen corresponding path program 1 times [2025-01-09 14:44:46,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:46,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812629083] [2025-01-09 14:44:46,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:46,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:46,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-01-09 14:44:46,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-01-09 14:44:46,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:46,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:47,169 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-01-09 14:44:47,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:47,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812629083] [2025-01-09 14:44:47,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812629083] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:47,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:47,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:44:47,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022313382] [2025-01-09 14:44:47,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:47,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:44:47,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:47,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:44:47,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:44:47,171 INFO L87 Difference]: Start difference. First operand 3365 states and 5417 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 14:44:47,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:47,579 INFO L93 Difference]: Finished difference Result 9481 states and 15246 transitions. [2025-01-09 14:44:47,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:44:47,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 494 [2025-01-09 14:44:47,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:47,606 INFO L225 Difference]: With dead ends: 9481 [2025-01-09 14:44:47,606 INFO L226 Difference]: Without dead ends: 6247 [2025-01-09 14:44:47,613 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:44:47,614 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 283 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:47,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 1207 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:44:47,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6247 states. [2025-01-09 14:44:47,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6247 to 6241. [2025-01-09 14:44:47,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6241 states, 5236 states have (on average 1.5404889228418641) internal successors, (8066), 5264 states have internal predecessors, (8066), 969 states have call successors, (969), 35 states have call predecessors, (969), 35 states have return successors, (969), 941 states have call predecessors, (969), 969 states have call successors, (969) [2025-01-09 14:44:47,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6241 states to 6241 states and 10004 transitions. [2025-01-09 14:44:47,873 INFO L78 Accepts]: Start accepts. Automaton has 6241 states and 10004 transitions. Word has length 494 [2025-01-09 14:44:47,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:47,874 INFO L471 AbstractCegarLoop]: Abstraction has 6241 states and 10004 transitions. [2025-01-09 14:44:47,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 14:44:47,874 INFO L276 IsEmpty]: Start isEmpty. Operand 6241 states and 10004 transitions. [2025-01-09 14:44:47,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-01-09 14:44:47,882 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:47,883 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:47,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:44:47,883 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:47,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:47,883 INFO L85 PathProgramCache]: Analyzing trace with hash -2026853502, now seen corresponding path program 1 times [2025-01-09 14:44:47,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:47,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286289433] [2025-01-09 14:44:47,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:47,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:47,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-01-09 14:44:48,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-01-09 14:44:48,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:48,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:49,299 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-01-09 14:44:49,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:49,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286289433] [2025-01-09 14:44:49,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286289433] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:49,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:49,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 14:44:49,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030460287] [2025-01-09 14:44:49,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:49,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:44:49,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:49,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:44:49,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:44:49,305 INFO L87 Difference]: Start difference. First operand 6241 states and 10004 transitions. Second operand has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 14:44:50,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:50,650 INFO L93 Difference]: Finished difference Result 22504 states and 36109 transitions. [2025-01-09 14:44:50,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 14:44:50,651 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 494 [2025-01-09 14:44:50,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:50,700 INFO L225 Difference]: With dead ends: 22504 [2025-01-09 14:44:50,701 INFO L226 Difference]: Without dead ends: 16398 [2025-01-09 14:44:50,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:44:50,716 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 1506 mSDsluCounter, 1987 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 2416 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:50,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 2416 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 14:44:50,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16398 states. [2025-01-09 14:44:51,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16398 to 7783. [2025-01-09 14:44:51,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7783 states, 6778 states have (on average 1.5603422838595455) internal successors, (10576), 6806 states have internal predecessors, (10576), 969 states have call successors, (969), 35 states have call predecessors, (969), 35 states have return successors, (969), 941 states have call predecessors, (969), 969 states have call successors, (969) [2025-01-09 14:44:51,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7783 states to 7783 states and 12514 transitions. [2025-01-09 14:44:51,100 INFO L78 Accepts]: Start accepts. Automaton has 7783 states and 12514 transitions. Word has length 494 [2025-01-09 14:44:51,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:51,103 INFO L471 AbstractCegarLoop]: Abstraction has 7783 states and 12514 transitions. [2025-01-09 14:44:51,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 14:44:51,104 INFO L276 IsEmpty]: Start isEmpty. Operand 7783 states and 12514 transitions. [2025-01-09 14:44:51,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-01-09 14:44:51,113 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:51,113 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:51,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:44:51,113 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:51,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:51,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1209205052, now seen corresponding path program 1 times [2025-01-09 14:44:51,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:51,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435808449] [2025-01-09 14:44:51,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:51,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:51,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-01-09 14:44:52,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-01-09 14:44:52,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:52,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:52,682 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 57 proven. 159 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-01-09 14:44:52,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:52,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435808449] [2025-01-09 14:44:52,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435808449] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:44:52,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873246667] [2025-01-09 14:44:52,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:52,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:44:52,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:44:52,686 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:44:52,688 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:44:52,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-01-09 14:44:52,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-01-09 14:44:52,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:52,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:52,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 1215 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 14:44:52,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:44:55,030 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 1951 proven. 195 refuted. 0 times theorem prover too weak. 8366 trivial. 0 not checked. [2025-01-09 14:44:55,030 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:44:55,908 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 21 proven. 195 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-01-09 14:44:55,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873246667] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:44:55,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:44:55,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 8] total 17 [2025-01-09 14:44:55,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308011353] [2025-01-09 14:44:55,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:44:55,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 14:44:55,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:55,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 14:44:55,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:44:55,916 INFO L87 Difference]: Start difference. First operand 7783 states and 12514 transitions. Second operand has 17 states, 17 states have (on average 19.294117647058822) internal successors, (328), 17 states have internal predecessors, (328), 8 states have call successors, (219), 4 states have call predecessors, (219), 7 states have return successors, (219), 8 states have call predecessors, (219), 8 states have call successors, (219) [2025-01-09 14:44:57,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:57,829 INFO L93 Difference]: Finished difference Result 18127 states and 28909 transitions. [2025-01-09 14:44:57,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 14:44:57,830 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 19.294117647058822) internal successors, (328), 17 states have internal predecessors, (328), 8 states have call successors, (219), 4 states have call predecessors, (219), 7 states have return successors, (219), 8 states have call predecessors, (219), 8 states have call successors, (219) Word has length 494 [2025-01-09 14:44:57,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:57,861 INFO L225 Difference]: With dead ends: 18127 [2025-01-09 14:44:57,861 INFO L226 Difference]: Without dead ends: 10654 [2025-01-09 14:44:57,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1017 GetRequests, 979 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=393, Invalid=1167, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 14:44:57,876 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 2476 mSDsluCounter, 1368 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 505 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2476 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 505 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:57,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2476 Valid, 1681 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [505 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 14:44:57,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10654 states. [2025-01-09 14:44:58,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10654 to 10420. [2025-01-09 14:44:58,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10420 states, 8997 states have (on average 1.5340669111926197) internal successors, (13802), 9037 states have internal predecessors, (13802), 1337 states have call successors, (1337), 85 states have call predecessors, (1337), 85 states have return successors, (1337), 1297 states have call predecessors, (1337), 1337 states have call successors, (1337) [2025-01-09 14:44:58,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10420 states to 10420 states and 16476 transitions. [2025-01-09 14:44:58,506 INFO L78 Accepts]: Start accepts. Automaton has 10420 states and 16476 transitions. Word has length 494 [2025-01-09 14:44:58,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:58,508 INFO L471 AbstractCegarLoop]: Abstraction has 10420 states and 16476 transitions. [2025-01-09 14:44:58,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 19.294117647058822) internal successors, (328), 17 states have internal predecessors, (328), 8 states have call successors, (219), 4 states have call predecessors, (219), 7 states have return successors, (219), 8 states have call predecessors, (219), 8 states have call successors, (219) [2025-01-09 14:44:58,509 INFO L276 IsEmpty]: Start isEmpty. Operand 10420 states and 16476 transitions. [2025-01-09 14:44:58,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-01-09 14:44:58,518 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:58,518 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:58,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 14:44:58,719 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:44:58,719 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:58,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:58,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1509164922, now seen corresponding path program 1 times [2025-01-09 14:44:58,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:58,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627880572] [2025-01-09 14:44:58,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:58,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:58,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-01-09 14:44:58,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-01-09 14:44:58,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:58,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:00,304 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-01-09 14:45:00,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:00,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627880572] [2025-01-09 14:45:00,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627880572] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:00,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:00,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 14:45:00,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910096561] [2025-01-09 14:45:00,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:00,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 14:45:00,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:00,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 14:45:00,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-09 14:45:00,306 INFO L87 Difference]: Start difference. First operand 10420 states and 16476 transitions. Second operand has 12 states, 12 states have (on average 11.0) internal successors, (132), 12 states have internal predecessors, (132), 3 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 3 states have call predecessors, (73), 3 states have call successors, (73) [2025-01-09 14:45:04,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:04,342 INFO L93 Difference]: Finished difference Result 44614 states and 70123 transitions. [2025-01-09 14:45:04,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 14:45:04,342 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 11.0) internal successors, (132), 12 states have internal predecessors, (132), 3 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 3 states have call predecessors, (73), 3 states have call successors, (73) Word has length 494 [2025-01-09 14:45:04,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:04,438 INFO L225 Difference]: With dead ends: 44614 [2025-01-09 14:45:04,438 INFO L226 Difference]: Without dead ends: 35680 [2025-01-09 14:45:04,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=460, Unknown=0, NotChecked=0, Total=650 [2025-01-09 14:45:04,464 INFO L435 NwaCegarLoop]: 1190 mSDtfsCounter, 3629 mSDsluCounter, 5155 mSDsCounter, 0 mSdLazyCounter, 2925 mSolverCounterSat, 601 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3629 SdHoareTripleChecker+Valid, 6345 SdHoareTripleChecker+Invalid, 3526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 601 IncrementalHoareTripleChecker+Valid, 2925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:04,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3629 Valid, 6345 Invalid, 3526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [601 Valid, 2925 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-09 14:45:04,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35680 states. [2025-01-09 14:45:06,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35680 to 29876. [2025-01-09 14:45:06,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29876 states, 26333 states have (on average 1.5371586982113699) internal successors, (40478), 26449 states have internal predecessors, (40478), 3273 states have call successors, (3273), 269 states have call predecessors, (3273), 269 states have return successors, (3273), 3157 states have call predecessors, (3273), 3273 states have call successors, (3273) [2025-01-09 14:45:06,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29876 states to 29876 states and 47024 transitions. [2025-01-09 14:45:06,230 INFO L78 Accepts]: Start accepts. Automaton has 29876 states and 47024 transitions. Word has length 494 [2025-01-09 14:45:06,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:06,231 INFO L471 AbstractCegarLoop]: Abstraction has 29876 states and 47024 transitions. [2025-01-09 14:45:06,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.0) internal successors, (132), 12 states have internal predecessors, (132), 3 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 3 states have call predecessors, (73), 3 states have call successors, (73) [2025-01-09 14:45:06,231 INFO L276 IsEmpty]: Start isEmpty. Operand 29876 states and 47024 transitions. [2025-01-09 14:45:06,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-01-09 14:45:06,262 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:06,262 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:06,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:45:06,262 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:06,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:06,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1505938696, now seen corresponding path program 1 times [2025-01-09 14:45:06,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:06,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387628669] [2025-01-09 14:45:06,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:06,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:06,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-01-09 14:45:06,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-01-09 14:45:06,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:06,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:07,873 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-01-09 14:45:07,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:07,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387628669] [2025-01-09 14:45:07,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387628669] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:07,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:07,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 14:45:07,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268230942] [2025-01-09 14:45:07,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:07,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:45:07,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:07,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:45:07,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:45:07,876 INFO L87 Difference]: Start difference. First operand 29876 states and 47024 transitions. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 14:45:14,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:14,261 INFO L93 Difference]: Finished difference Result 174623 states and 271697 transitions. [2025-01-09 14:45:14,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 14:45:14,263 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 494 [2025-01-09 14:45:14,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:14,732 INFO L225 Difference]: With dead ends: 174623 [2025-01-09 14:45:14,732 INFO L226 Difference]: Without dead ends: 145657 [2025-01-09 14:45:14,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2025-01-09 14:45:14,814 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 2043 mSDsluCounter, 2198 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2043 SdHoareTripleChecker+Valid, 3055 SdHoareTripleChecker+Invalid, 967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:14,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2043 Valid, 3055 Invalid, 967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 14:45:14,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145657 states. [2025-01-09 14:45:18,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145657 to 105073. [2025-01-09 14:45:18,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105073 states, 97921 states have (on average 1.5581642344338804) internal successors, (152577), 98245 states have internal predecessors, (152577), 6401 states have call successors, (6401), 750 states have call predecessors, (6401), 750 states have return successors, (6401), 6077 states have call predecessors, (6401), 6401 states have call successors, (6401) [2025-01-09 14:45:18,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105073 states to 105073 states and 165379 transitions. [2025-01-09 14:45:18,795 INFO L78 Accepts]: Start accepts. Automaton has 105073 states and 165379 transitions. Word has length 494 [2025-01-09 14:45:18,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:18,797 INFO L471 AbstractCegarLoop]: Abstraction has 105073 states and 165379 transitions. [2025-01-09 14:45:18,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 14:45:18,797 INFO L276 IsEmpty]: Start isEmpty. Operand 105073 states and 165379 transitions. [2025-01-09 14:45:18,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-01-09 14:45:18,908 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:18,909 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:18,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:45:18,909 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:18,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:18,909 INFO L85 PathProgramCache]: Analyzing trace with hash 134131398, now seen corresponding path program 1 times [2025-01-09 14:45:18,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:18,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513273740] [2025-01-09 14:45:18,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:18,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:18,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-01-09 14:45:19,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-01-09 14:45:19,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:19,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:19,450 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-01-09 14:45:19,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:19,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513273740] [2025-01-09 14:45:19,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513273740] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:19,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:19,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:45:19,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928904830] [2025-01-09 14:45:19,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:19,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:45:19,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:19,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:45:19,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:45:19,452 INFO L87 Difference]: Start difference. First operand 105073 states and 165379 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 14:45:25,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:25,325 INFO L93 Difference]: Finished difference Result 245051 states and 382768 transitions. [2025-01-09 14:45:25,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:45:25,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 494 [2025-01-09 14:45:25,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:25,666 INFO L225 Difference]: With dead ends: 245051 [2025-01-09 14:45:25,666 INFO L226 Difference]: Without dead ends: 140111 [2025-01-09 14:45:25,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:45:25,779 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 385 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:25,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 1121 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:45:25,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140111 states. [2025-01-09 14:45:28,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140111 to 68127. [2025-01-09 14:45:28,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68127 states, 64879 states have (on average 1.5783073105319132) internal successors, (102399), 65003 states have internal predecessors, (102399), 2905 states have call successors, (2905), 342 states have call predecessors, (2905), 342 states have return successors, (2905), 2781 states have call predecessors, (2905), 2905 states have call successors, (2905) [2025-01-09 14:45:28,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68127 states to 68127 states and 108209 transitions. [2025-01-09 14:45:28,828 INFO L78 Accepts]: Start accepts. Automaton has 68127 states and 108209 transitions. Word has length 494 [2025-01-09 14:45:28,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:28,829 INFO L471 AbstractCegarLoop]: Abstraction has 68127 states and 108209 transitions. [2025-01-09 14:45:28,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 14:45:28,830 INFO L276 IsEmpty]: Start isEmpty. Operand 68127 states and 108209 transitions. [2025-01-09 14:45:28,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-01-09 14:45:28,881 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:28,881 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:28,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:45:28,882 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:28,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:28,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1606441338, now seen corresponding path program 1 times [2025-01-09 14:45:28,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:28,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830977758] [2025-01-09 14:45:28,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:28,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:28,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-01-09 14:45:29,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-01-09 14:45:29,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:29,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:29,526 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-01-09 14:45:29,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:29,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830977758] [2025-01-09 14:45:29,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830977758] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:29,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:29,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:45:29,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221819575] [2025-01-09 14:45:29,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:29,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:45:29,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:29,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:45:29,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:45:29,529 INFO L87 Difference]: Start difference. First operand 68127 states and 108209 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73)