./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-82.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-82.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 f85bc794ddaf472a7e3079e39d319628ff71704bc56bc279abbe4af1f903e58e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:28:53,296 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:28:53,350 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:28:53,359 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:28:53,359 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:28:53,385 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:28:53,386 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:28:53,387 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:28:53,387 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:28:53,387 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:28:53,388 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:28:53,388 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:28:53,388 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:28:53,388 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:28:53,389 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:28:53,389 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:28:53,389 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:28:53,389 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:28:53,389 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:28:53,389 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:28:53,389 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:28:53,389 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:28:53,389 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:28:53,389 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:28:53,390 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:28:53,390 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:28:53,390 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:28:53,390 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:28:53,390 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:28:53,390 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:28:53,390 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:28:53,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:28:53,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:28:53,390 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:28:53,390 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:28:53,390 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:28:53,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:28:53,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:28:53,390 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:28:53,390 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:28:53,390 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:28:53,390 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:28:53,390 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:28:53,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:28:53,390 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:28:53,390 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:28:53,390 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:28:53,390 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:28:53,391 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 -> f85bc794ddaf472a7e3079e39d319628ff71704bc56bc279abbe4af1f903e58e [2025-01-09 14:28:53,633 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:28:53,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:28:53,642 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:28:53,645 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:28:53,645 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:28:53,646 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-82.i [2025-01-09 14:28:54,856 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b8672d1b/d9153f1dfec74d9a81be34cbcee044dd/FLAGabd46cd68 [2025-01-09 14:28:55,154 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:28:55,159 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-82.i [2025-01-09 14:28:55,173 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b8672d1b/d9153f1dfec74d9a81be34cbcee044dd/FLAGabd46cd68 [2025-01-09 14:28:55,187 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b8672d1b/d9153f1dfec74d9a81be34cbcee044dd [2025-01-09 14:28:55,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:28:55,193 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:28:55,194 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:28:55,194 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:28:55,200 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:28:55,201 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:28:55" (1/1) ... [2025-01-09 14:28:55,201 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77a1a9c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:55, skipping insertion in model container [2025-01-09 14:28:55,202 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:28:55" (1/1) ... [2025-01-09 14:28:55,225 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:28:55,321 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-82.i[916,929] [2025-01-09 14:28:55,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:28:55,415 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:28:55,425 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-82.i[916,929] [2025-01-09 14:28:55,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:28:55,525 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:28:55,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:55 WrapperNode [2025-01-09 14:28:55,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:28:55,527 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:28:55,527 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:28:55,528 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:28:55,532 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:28:55" (1/1) ... [2025-01-09 14:28:55,550 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:28:55" (1/1) ... [2025-01-09 14:28:55,620 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 498 [2025-01-09 14:28:55,621 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:28:55,621 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:28:55,622 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:28:55,622 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:28:55,629 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:55" (1/1) ... [2025-01-09 14:28:55,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:55" (1/1) ... [2025-01-09 14:28:55,645 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:55" (1/1) ... [2025-01-09 14:28:55,681 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:28:55,681 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:55" (1/1) ... [2025-01-09 14:28:55,682 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:55" (1/1) ... [2025-01-09 14:28:55,708 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:55" (1/1) ... [2025-01-09 14:28:55,713 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:55" (1/1) ... [2025-01-09 14:28:55,720 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:55" (1/1) ... [2025-01-09 14:28:55,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:55" (1/1) ... [2025-01-09 14:28:55,736 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:55" (1/1) ... [2025-01-09 14:28:55,750 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:28:55,752 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:28:55,752 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:28:55,752 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:28:55,753 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:55" (1/1) ... [2025-01-09 14:28:55,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:28:55,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:28:55,781 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:28:55,792 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:28:55,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:28:55,808 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:28:55,808 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:28:55,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:28:55,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:28:55,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:28:55,898 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:28:55,899 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:28:56,587 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2025-01-09 14:28:56,587 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:28:56,600 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:28:56,600 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:28:56,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:28:56 BoogieIcfgContainer [2025-01-09 14:28:56,601 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:28:56,602 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:28:56,602 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:28:56,605 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:28:56,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:28:55" (1/3) ... [2025-01-09 14:28:56,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7828aad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:28:56, skipping insertion in model container [2025-01-09 14:28:56,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:55" (2/3) ... [2025-01-09 14:28:56,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7828aad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:28:56, skipping insertion in model container [2025-01-09 14:28:56,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:28:56" (3/3) ... [2025-01-09 14:28:56,609 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-82.i [2025-01-09 14:28:56,619 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:28:56,646 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-82.i that has 2 procedures, 204 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:28:56,702 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:28:56,714 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;@6f40ad86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:28:56,714 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:28:56,718 INFO L276 IsEmpty]: Start isEmpty. Operand has 204 states, 151 states have (on average 1.5231788079470199) internal successors, (230), 152 states have internal predecessors, (230), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 14:28:56,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-01-09 14:28:56,735 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:28:56,735 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:56,736 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:28:56,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:28:56,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1206134899, now seen corresponding path program 1 times [2025-01-09 14:28:56,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:28:56,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478317953] [2025-01-09 14:28:56,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:28:56,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:28:56,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-01-09 14:28:56,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-01-09 14:28:56,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:28:56,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:28:57,203 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2025-01-09 14:28:57,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:28:57,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478317953] [2025-01-09 14:28:57,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478317953] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:28:57,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595604869] [2025-01-09 14:28:57,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:28:57,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:28:57,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:28:57,211 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:28:57,214 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:28:57,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-01-09 14:28:57,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-01-09 14:28:57,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:28:57,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:28:57,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 784 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:28:57,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:28:57,525 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2025-01-09 14:28:57,525 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:28:57,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595604869] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:28:57,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:28:57,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:28:57,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306025570] [2025-01-09 14:28:57,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:28:57,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:28:57,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:28:57,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:28:57,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:28:57,556 INFO L87 Difference]: Start difference. First operand has 204 states, 151 states have (on average 1.5231788079470199) internal successors, (230), 152 states have internal predecessors, (230), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 2 states, 2 states have (on average 44.5) internal successors, (89), 2 states have internal predecessors, (89), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-01-09 14:28:57,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:28:57,605 INFO L93 Difference]: Finished difference Result 402 states and 705 transitions. [2025-01-09 14:28:57,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:28:57,606 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 44.5) internal successors, (89), 2 states have internal predecessors, (89), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 334 [2025-01-09 14:28:57,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:28:57,615 INFO L225 Difference]: With dead ends: 402 [2025-01-09 14:28:57,615 INFO L226 Difference]: Without dead ends: 201 [2025-01-09 14:28:57,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 335 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:28:57,620 INFO L435 NwaCegarLoop]: 324 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, 324 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:28:57,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:28:57,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-01-09 14:28:57,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2025-01-09 14:28:57,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 149 states have (on average 1.5033557046979866) internal successors, (224), 149 states have internal predecessors, (224), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 14:28:57,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 324 transitions. [2025-01-09 14:28:57,670 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 324 transitions. Word has length 334 [2025-01-09 14:28:57,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:28:57,672 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 324 transitions. [2025-01-09 14:28:57,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 44.5) internal successors, (89), 2 states have internal predecessors, (89), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-01-09 14:28:57,672 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 324 transitions. [2025-01-09 14:28:57,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-01-09 14:28:57,679 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:28:57,680 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:57,691 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:28:57,881 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:28:57,881 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:28:57,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:28:57,883 INFO L85 PathProgramCache]: Analyzing trace with hash 219782929, now seen corresponding path program 1 times [2025-01-09 14:28:57,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:28:57,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893678770] [2025-01-09 14:28:57,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:28:57,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:28:57,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-01-09 14:28:58,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-01-09 14:28:58,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:28:58,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:28:58,515 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 14:28:58,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:28:58,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893678770] [2025-01-09 14:28:58,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893678770] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:28:58,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:28:58,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:28:58,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413134552] [2025-01-09 14:28:58,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:28:58,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:28:58,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:28:58,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:28:58,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:28:58,521 INFO L87 Difference]: Start difference. First operand 201 states and 324 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:28:58,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:28:58,864 INFO L93 Difference]: Finished difference Result 665 states and 1076 transitions. [2025-01-09 14:28:58,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:28:58,865 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 334 [2025-01-09 14:28:58,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:28:58,869 INFO L225 Difference]: With dead ends: 665 [2025-01-09 14:28:58,869 INFO L226 Difference]: Without dead ends: 467 [2025-01-09 14:28:58,870 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:28:58,871 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 401 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:28:58,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 1013 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:28:58,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-01-09 14:28:58,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 430. [2025-01-09 14:28:58,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 327 states have (on average 1.525993883792049) internal successors, (499), 327 states have internal predecessors, (499), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 14:28:58,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 699 transitions. [2025-01-09 14:28:58,920 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 699 transitions. Word has length 334 [2025-01-09 14:28:58,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:28:58,922 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 699 transitions. [2025-01-09 14:28:58,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:28:58,923 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 699 transitions. [2025-01-09 14:28:58,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-01-09 14:28:58,927 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:28:58,928 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:58,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:28:58,931 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:28:58,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:28:58,932 INFO L85 PathProgramCache]: Analyzing trace with hash 469893018, now seen corresponding path program 1 times [2025-01-09 14:28:58,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:28:58,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500649664] [2025-01-09 14:28:58,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:28:58,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:28:58,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-01-09 14:28:59,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-01-09 14:28:59,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:28:59,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:28:59,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 14:28:59,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:28:59,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500649664] [2025-01-09 14:28:59,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500649664] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:28:59,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:28:59,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:28:59,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548790774] [2025-01-09 14:28:59,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:28:59,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:28:59,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:28:59,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:28:59,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:28:59,708 INFO L87 Difference]: Start difference. First operand 430 states and 699 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:29:00,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:00,145 INFO L93 Difference]: Finished difference Result 1425 states and 2318 transitions. [2025-01-09 14:29:00,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:29:00,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 335 [2025-01-09 14:29:00,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:00,155 INFO L225 Difference]: With dead ends: 1425 [2025-01-09 14:29:00,158 INFO L226 Difference]: Without dead ends: 998 [2025-01-09 14:29:00,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:29:00,161 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 388 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 1353 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:00,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 1353 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:29:00,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2025-01-09 14:29:00,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 844. [2025-01-09 14:29:00,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 639 states have (on average 1.517996870109546) internal successors, (970), 639 states have internal predecessors, (970), 200 states have call successors, (200), 4 states have call predecessors, (200), 4 states have return successors, (200), 200 states have call predecessors, (200), 200 states have call successors, (200) [2025-01-09 14:29:00,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1370 transitions. [2025-01-09 14:29:00,245 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1370 transitions. Word has length 335 [2025-01-09 14:29:00,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:00,246 INFO L471 AbstractCegarLoop]: Abstraction has 844 states and 1370 transitions. [2025-01-09 14:29:00,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:29:00,246 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1370 transitions. [2025-01-09 14:29:00,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-01-09 14:29:00,249 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:00,249 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:00,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:29:00,250 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:00,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:00,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1793633124, now seen corresponding path program 1 times [2025-01-09 14:29:00,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:00,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63200116] [2025-01-09 14:29:00,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:00,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:00,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-01-09 14:29:00,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-01-09 14:29:00,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:00,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:01,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 14:29:01,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:01,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63200116] [2025-01-09 14:29:01,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63200116] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:29:01,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:29:01,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:29:01,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487945277] [2025-01-09 14:29:01,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:29:01,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:29:01,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:01,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:29:01,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:29:01,076 INFO L87 Difference]: Start difference. First operand 844 states and 1370 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:29:01,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:01,562 INFO L93 Difference]: Finished difference Result 2622 states and 4230 transitions. [2025-01-09 14:29:01,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:29:01,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 335 [2025-01-09 14:29:01,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:01,574 INFO L225 Difference]: With dead ends: 2622 [2025-01-09 14:29:01,574 INFO L226 Difference]: Without dead ends: 1973 [2025-01-09 14:29:01,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:29:01,578 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 656 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:01,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 1123 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:29:01,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1973 states. [2025-01-09 14:29:01,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1973 to 1561. [2025-01-09 14:29:01,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1561 states, 1240 states have (on average 1.5475806451612903) internal successors, (1919), 1244 states have internal predecessors, (1919), 312 states have call successors, (312), 8 states have call predecessors, (312), 8 states have return successors, (312), 308 states have call predecessors, (312), 312 states have call successors, (312) [2025-01-09 14:29:01,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 2543 transitions. [2025-01-09 14:29:01,678 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 2543 transitions. Word has length 335 [2025-01-09 14:29:01,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:01,678 INFO L471 AbstractCegarLoop]: Abstraction has 1561 states and 2543 transitions. [2025-01-09 14:29:01,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:29:01,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2543 transitions. [2025-01-09 14:29:01,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-01-09 14:29:01,681 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:01,681 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:01,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:29:01,682 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:01,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:01,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1480265818, now seen corresponding path program 1 times [2025-01-09 14:29:01,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:01,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319935814] [2025-01-09 14:29:01,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:01,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:01,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-01-09 14:29:01,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-01-09 14:29:01,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:01,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:02,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 14:29:02,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:02,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319935814] [2025-01-09 14:29:02,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319935814] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:29:02,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:29:02,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:29:02,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34804830] [2025-01-09 14:29:02,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:29:02,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:29:02,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:02,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:29:02,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:29:02,204 INFO L87 Difference]: Start difference. First operand 1561 states and 2543 transitions. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-01-09 14:29:04,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:04,055 INFO L93 Difference]: Finished difference Result 7627 states and 12365 transitions. [2025-01-09 14:29:04,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 14:29:04,056 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 335 [2025-01-09 14:29:04,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:04,091 INFO L225 Difference]: With dead ends: 7627 [2025-01-09 14:29:04,092 INFO L226 Difference]: Without dead ends: 6069 [2025-01-09 14:29:04,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:29:04,100 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 1337 mSDsluCounter, 1983 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 354 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1337 SdHoareTripleChecker+Valid, 2574 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:04,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1337 Valid, 2574 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 14:29:04,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6069 states. [2025-01-09 14:29:04,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6069 to 5175. [2025-01-09 14:29:04,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5175 states, 4326 states have (on average 1.5788257050392973) internal successors, (6830), 4346 states have internal predecessors, (6830), 816 states have call successors, (816), 32 states have call predecessors, (816), 32 states have return successors, (816), 796 states have call predecessors, (816), 816 states have call successors, (816) [2025-01-09 14:29:04,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5175 states to 5175 states and 8462 transitions. [2025-01-09 14:29:04,421 INFO L78 Accepts]: Start accepts. Automaton has 5175 states and 8462 transitions. Word has length 335 [2025-01-09 14:29:04,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:04,422 INFO L471 AbstractCegarLoop]: Abstraction has 5175 states and 8462 transitions. [2025-01-09 14:29:04,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-01-09 14:29:04,422 INFO L276 IsEmpty]: Start isEmpty. Operand 5175 states and 8462 transitions. [2025-01-09 14:29:04,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-01-09 14:29:04,430 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:04,430 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:04,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:29:04,430 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:04,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:04,431 INFO L85 PathProgramCache]: Analyzing trace with hash -569122024, now seen corresponding path program 1 times [2025-01-09 14:29:04,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:04,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107242002] [2025-01-09 14:29:04,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:04,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:04,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-01-09 14:29:04,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-01-09 14:29:04,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:04,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:05,218 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 14:29:05,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:05,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107242002] [2025-01-09 14:29:05,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107242002] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:29:05,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:29:05,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:29:05,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972494329] [2025-01-09 14:29:05,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:29:05,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:29:05,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:05,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:29:05,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:29:05,222 INFO L87 Difference]: Start difference. First operand 5175 states and 8462 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:29:05,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:05,875 INFO L93 Difference]: Finished difference Result 12659 states and 20676 transitions. [2025-01-09 14:29:05,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:29:05,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 335 [2025-01-09 14:29:05,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:05,910 INFO L225 Difference]: With dead ends: 12659 [2025-01-09 14:29:05,911 INFO L226 Difference]: Without dead ends: 7487 [2025-01-09 14:29:05,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:29:05,926 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 225 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:05,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 1099 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:29:05,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7487 states. [2025-01-09 14:29:06,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7487 to 5285. [2025-01-09 14:29:06,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5285 states, 4385 states have (on average 1.5733181299885974) internal successors, (6899), 4405 states have internal predecessors, (6899), 866 states have call successors, (866), 33 states have call predecessors, (866), 33 states have return successors, (866), 846 states have call predecessors, (866), 866 states have call successors, (866) [2025-01-09 14:29:06,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5285 states to 5285 states and 8631 transitions. [2025-01-09 14:29:06,411 INFO L78 Accepts]: Start accepts. Automaton has 5285 states and 8631 transitions. Word has length 335 [2025-01-09 14:29:06,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:06,412 INFO L471 AbstractCegarLoop]: Abstraction has 5285 states and 8631 transitions. [2025-01-09 14:29:06,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:29:06,413 INFO L276 IsEmpty]: Start isEmpty. Operand 5285 states and 8631 transitions. [2025-01-09 14:29:06,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-01-09 14:29:06,421 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:06,421 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:06,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:29:06,422 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:06,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:06,422 INFO L85 PathProgramCache]: Analyzing trace with hash -992768746, now seen corresponding path program 1 times [2025-01-09 14:29:06,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:06,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858554315] [2025-01-09 14:29:06,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:06,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:06,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-01-09 14:29:06,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-01-09 14:29:06,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:06,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:07,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 108 proven. 39 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-01-09 14:29:07,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:07,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858554315] [2025-01-09 14:29:07,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858554315] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:29:07,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465513206] [2025-01-09 14:29:07,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:07,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:29:07,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:29:07,689 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:29:07,690 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:29:07,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-01-09 14:29:07,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-01-09 14:29:07,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:07,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:07,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 784 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-01-09 14:29:07,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:29:12,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 3230 proven. 594 refuted. 0 times theorem prover too weak. 1076 trivial. 0 not checked. [2025-01-09 14:29:12,641 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:29:14,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465513206] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:29:14,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 14:29:14,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 29] total 40 [2025-01-09 14:29:14,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596066051] [2025-01-09 14:29:14,011 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 14:29:14,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-01-09 14:29:14,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:14,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-01-09 14:29:14,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=1873, Unknown=0, NotChecked=0, Total=2162 [2025-01-09 14:29:14,014 INFO L87 Difference]: Start difference. First operand 5285 states and 8631 transitions. Second operand has 40 states, 40 states have (on average 4.875) internal successors, (195), 38 states have internal predecessors, (195), 10 states have call successors, (100), 9 states have call predecessors, (100), 14 states have return successors, (100), 10 states have call predecessors, (100), 10 states have call successors, (100) [2025-01-09 14:29:48,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:48,275 INFO L93 Difference]: Finished difference Result 184531 states and 294422 transitions. [2025-01-09 14:29:48,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 246 states. [2025-01-09 14:29:48,276 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 4.875) internal successors, (195), 38 states have internal predecessors, (195), 10 states have call successors, (100), 9 states have call predecessors, (100), 14 states have return successors, (100), 10 states have call predecessors, (100), 10 states have call successors, (100) Word has length 335 [2025-01-09 14:29:48,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:48,860 INFO L225 Difference]: With dead ends: 184531 [2025-01-09 14:29:48,861 INFO L226 Difference]: Without dead ends: 179341 [2025-01-09 14:29:48,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 766 GetRequests, 484 SyntacticMatches, 0 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33754 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=7678, Invalid=72694, Unknown=0, NotChecked=0, Total=80372 [2025-01-09 14:29:48,924 INFO L435 NwaCegarLoop]: 1005 mSDtfsCounter, 14941 mSDsluCounter, 12997 mSDsCounter, 0 mSdLazyCounter, 13967 mSolverCounterSat, 3493 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15063 SdHoareTripleChecker+Valid, 14002 SdHoareTripleChecker+Invalid, 17460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3493 IncrementalHoareTripleChecker+Valid, 13967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:48,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15063 Valid, 14002 Invalid, 17460 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3493 Valid, 13967 Invalid, 0 Unknown, 0 Unchecked, 12.8s Time] [2025-01-09 14:29:49,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179341 states. [2025-01-09 14:29:54,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179341 to 91688. [2025-01-09 14:29:54,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91688 states, 81810 states have (on average 1.6039115022613373) internal successors, (131216), 82174 states have internal predecessors, (131216), 9378 states have call successors, (9378), 499 states have call predecessors, (9378), 499 states have return successors, (9378), 9014 states have call predecessors, (9378), 9378 states have call successors, (9378) [2025-01-09 14:29:55,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91688 states to 91688 states and 149972 transitions. [2025-01-09 14:29:55,173 INFO L78 Accepts]: Start accepts. Automaton has 91688 states and 149972 transitions. Word has length 335 [2025-01-09 14:29:55,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:55,176 INFO L471 AbstractCegarLoop]: Abstraction has 91688 states and 149972 transitions. [2025-01-09 14:29:55,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 4.875) internal successors, (195), 38 states have internal predecessors, (195), 10 states have call successors, (100), 9 states have call predecessors, (100), 14 states have return successors, (100), 10 states have call predecessors, (100), 10 states have call successors, (100) [2025-01-09 14:29:55,177 INFO L276 IsEmpty]: Start isEmpty. Operand 91688 states and 149972 transitions. [2025-01-09 14:29:55,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-01-09 14:29:55,238 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:55,239 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:55,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 14:29:55,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:29:55,440 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:55,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:55,441 INFO L85 PathProgramCache]: Analyzing trace with hash -441186540, now seen corresponding path program 1 times [2025-01-09 14:29:55,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:55,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472616729] [2025-01-09 14:29:55,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:55,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:55,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-01-09 14:29:55,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-01-09 14:29:55,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:55,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:56,208 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 14:29:56,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:56,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472616729] [2025-01-09 14:29:56,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472616729] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:29:56,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:29:56,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:29:56,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777444449] [2025-01-09 14:29:56,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:29:56,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:29:56,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:56,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:29:56,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:29:56,212 INFO L87 Difference]: Start difference. First operand 91688 states and 149972 transitions. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:30:07,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:07,131 INFO L93 Difference]: Finished difference Result 356135 states and 586066 transitions. [2025-01-09 14:30:07,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 14:30:07,132 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 335 [2025-01-09 14:30:07,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:08,050 INFO L225 Difference]: With dead ends: 356135 [2025-01-09 14:30:08,050 INFO L226 Difference]: Without dead ends: 290355 [2025-01-09 14:30:08,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=254, Unknown=0, NotChecked=0, Total=380 [2025-01-09 14:30:08,205 INFO L435 NwaCegarLoop]: 981 mSDtfsCounter, 1944 mSDsluCounter, 3065 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1944 SdHoareTripleChecker+Valid, 4046 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:08,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1944 Valid, 4046 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 14:30:08,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290355 states.