./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-28.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-28.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 3fb6d49eff13d62236c26c76112d3edbdbe5247c358b6cacd9ecacff32cf6529 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:21:55,859 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:21:55,915 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:21:55,918 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:21:55,919 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:21:55,932 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:21:55,932 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:21:55,932 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:21:55,933 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:21:55,933 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:21:55,933 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:21:55,933 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:21:55,933 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:21:55,933 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:21:55,933 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:21:55,933 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:21:55,934 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:21:55,934 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:21:55,934 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:21:55,934 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:21:55,934 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:21:55,934 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:21:55,934 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:21:55,934 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:21:55,934 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:21:55,934 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:21:55,934 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:21:55,934 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:21:55,935 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:21:55,935 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:21:55,935 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:21:55,935 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:21:55,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:21:55,935 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:21:55,935 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:21:55,935 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:21:55,935 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:21:55,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:21:55,935 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:21:55,935 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:21:55,936 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:21:55,936 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:21:55,936 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:21:55,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:21:55,936 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:21:55,936 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:21:55,936 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:21:55,936 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:21:55,936 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 -> 3fb6d49eff13d62236c26c76112d3edbdbe5247c358b6cacd9ecacff32cf6529 [2025-01-09 14:21:56,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:21:56,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:21:56,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:21:56,210 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:21:56,210 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:21:56,211 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-28.i [2025-01-09 14:21:57,406 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/99db2a567/3d718dfe23bc442d929b544616c130d2/FLAG7bb46e539 [2025-01-09 14:21:57,673 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:21:57,673 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-28.i [2025-01-09 14:21:57,682 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/99db2a567/3d718dfe23bc442d929b544616c130d2/FLAG7bb46e539 [2025-01-09 14:21:57,981 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/99db2a567/3d718dfe23bc442d929b544616c130d2 [2025-01-09 14:21:57,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:21:57,984 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:21:57,985 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:21:57,985 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:21:57,989 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:21:57,989 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:21:57" (1/1) ... [2025-01-09 14:21:57,990 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55e0ecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:57, skipping insertion in model container [2025-01-09 14:21:57,990 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:21:57" (1/1) ... [2025-01-09 14:21:58,016 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:21:58,154 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-28.i[916,929] [2025-01-09 14:21:58,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:21:58,311 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:21:58,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-28.i[916,929] [2025-01-09 14:21:58,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:21:58,418 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:21:58,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:58 WrapperNode [2025-01-09 14:21:58,418 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:21:58,419 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:21:58,420 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:21:58,420 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:21:58,425 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:21:58" (1/1) ... [2025-01-09 14:21:58,441 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:21:58" (1/1) ... [2025-01-09 14:21:58,508 INFO L138 Inliner]: procedures = 26, calls = 56, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 408 [2025-01-09 14:21:58,509 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:21:58,510 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:21:58,510 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:21:58,510 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:21:58,517 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:58" (1/1) ... [2025-01-09 14:21:58,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:58" (1/1) ... [2025-01-09 14:21:58,530 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:58" (1/1) ... [2025-01-09 14:21:58,569 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:21:58,570 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:58" (1/1) ... [2025-01-09 14:21:58,570 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:58" (1/1) ... [2025-01-09 14:21:58,589 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:58" (1/1) ... [2025-01-09 14:21:58,595 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:58" (1/1) ... [2025-01-09 14:21:58,600 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:58" (1/1) ... [2025-01-09 14:21:58,612 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:58" (1/1) ... [2025-01-09 14:21:58,616 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:58" (1/1) ... [2025-01-09 14:21:58,627 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:21:58,629 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:21:58,629 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:21:58,629 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:21:58,630 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:58" (1/1) ... [2025-01-09 14:21:58,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:21:58,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:21:58,686 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:21:58,688 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:21:58,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:21:58,709 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:21:58,709 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:21:58,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:21:58,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:21:58,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:21:58,797 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:21:58,799 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:21:59,489 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2025-01-09 14:21:59,489 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:21:59,500 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:21:59,500 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:21:59,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:21:59 BoogieIcfgContainer [2025-01-09 14:21:59,501 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:21:59,505 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:21:59,505 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:21:59,508 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:21:59,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:21:57" (1/3) ... [2025-01-09 14:21:59,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b0b187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:21:59, skipping insertion in model container [2025-01-09 14:21:59,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:58" (2/3) ... [2025-01-09 14:21:59,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b0b187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:21:59, skipping insertion in model container [2025-01-09 14:21:59,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:21:59" (3/3) ... [2025-01-09 14:21:59,511 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-28.i [2025-01-09 14:21:59,521 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:21:59,524 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-28.i that has 2 procedures, 171 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:21:59,571 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:21:59,581 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;@fba8b6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:21:59,582 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:21:59,585 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 125 states have (on average 1.512) internal successors, (189), 126 states have internal predecessors, (189), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-01-09 14:21:59,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-01-09 14:21:59,602 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:21:59,603 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:59,604 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:21:59,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:21:59,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1876919121, now seen corresponding path program 1 times [2025-01-09 14:21:59,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:21:59,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193261544] [2025-01-09 14:21:59,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:59,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:21:59,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-01-09 14:21:59,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-01-09 14:21:59,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:59,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:00,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2025-01-09 14:22:00,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:22:00,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193261544] [2025-01-09 14:22:00,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193261544] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:22:00,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582474441] [2025-01-09 14:22:00,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:00,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:22:00,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:22:00,044 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:22:00,046 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:22:00,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-01-09 14:22:00,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-01-09 14:22:00,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:00,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:00,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:22:00,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:22:00,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2025-01-09 14:22:00,296 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:22:00,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582474441] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:22:00,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:22:00,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:22:00,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330755672] [2025-01-09 14:22:00,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:22:00,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:22:00,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:22:00,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:22:00,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:22:00,328 INFO L87 Difference]: Start difference. First operand has 171 states, 125 states have (on average 1.512) internal successors, (189), 126 states have internal predecessors, (189), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) Second operand has 2 states, 2 states have (on average 43.5) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) [2025-01-09 14:22:00,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:22:00,360 INFO L93 Difference]: Finished difference Result 336 states and 588 transitions. [2025-01-09 14:22:00,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:22:00,361 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 43.5) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) Word has length 297 [2025-01-09 14:22:00,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:22:00,367 INFO L225 Difference]: With dead ends: 336 [2025-01-09 14:22:00,367 INFO L226 Difference]: Without dead ends: 168 [2025-01-09 14:22:00,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 298 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:22:00,372 INFO L435 NwaCegarLoop]: 270 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, 270 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:22:00,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:22:00,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-01-09 14:22:00,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2025-01-09 14:22:00,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 123 states have (on average 1.4959349593495934) internal successors, (184), 123 states have internal predecessors, (184), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-01-09 14:22:00,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 270 transitions. [2025-01-09 14:22:00,410 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 270 transitions. Word has length 297 [2025-01-09 14:22:00,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:22:00,411 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 270 transitions. [2025-01-09 14:22:00,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 43.5) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) [2025-01-09 14:22:00,411 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 270 transitions. [2025-01-09 14:22:00,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-01-09 14:22:00,415 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:22:00,415 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:00,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 14:22:00,616 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:22:00,616 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:22:00,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:22:00,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1598711959, now seen corresponding path program 1 times [2025-01-09 14:22:00,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:22:00,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413145850] [2025-01-09 14:22:00,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:00,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:22:00,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-01-09 14:22:00,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-01-09 14:22:00,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:00,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:01,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:22:01,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:22:01,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413145850] [2025-01-09 14:22:01,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413145850] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:22:01,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:22:01,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:22:01,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430199816] [2025-01-09 14:22:01,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:22:01,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:22:01,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:22:01,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:22:01,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:22:01,046 INFO L87 Difference]: Start difference. First operand 168 states and 270 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:22:01,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:22:01,142 INFO L93 Difference]: Finished difference Result 462 states and 742 transitions. [2025-01-09 14:22:01,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:22:01,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 297 [2025-01-09 14:22:01,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:22:01,146 INFO L225 Difference]: With dead ends: 462 [2025-01-09 14:22:01,146 INFO L226 Difference]: Without dead ends: 297 [2025-01-09 14:22:01,151 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:22:01,152 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 197 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:22:01,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 624 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:22:01,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-01-09 14:22:01,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 294. [2025-01-09 14:22:01,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 225 states have (on average 1.5066666666666666) internal successors, (339), 226 states have internal predecessors, (339), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 14:22:01,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 471 transitions. [2025-01-09 14:22:01,183 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 471 transitions. Word has length 297 [2025-01-09 14:22:01,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:22:01,184 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 471 transitions. [2025-01-09 14:22:01,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:22:01,187 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 471 transitions. [2025-01-09 14:22:01,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-01-09 14:22:01,195 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:22:01,196 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:01,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:22:01,196 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:22:01,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:22:01,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1798862059, now seen corresponding path program 1 times [2025-01-09 14:22:01,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:22:01,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332748374] [2025-01-09 14:22:01,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:01,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:22:01,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-01-09 14:22:01,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-01-09 14:22:01,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:01,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:01,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:22:01,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:22:01,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332748374] [2025-01-09 14:22:01,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332748374] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:22:01,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:22:01,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:22:01,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884054305] [2025-01-09 14:22:01,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:22:01,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:22:01,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:22:01,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:22:01,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:22:01,459 INFO L87 Difference]: Start difference. First operand 294 states and 471 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:22:01,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:22:01,537 INFO L93 Difference]: Finished difference Result 870 states and 1395 transitions. [2025-01-09 14:22:01,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:22:01,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 297 [2025-01-09 14:22:01,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:22:01,547 INFO L225 Difference]: With dead ends: 870 [2025-01-09 14:22:01,549 INFO L226 Difference]: Without dead ends: 579 [2025-01-09 14:22:01,550 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:22:01,550 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 246 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:22:01,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 513 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:22:01,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-01-09 14:22:01,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 350. [2025-01-09 14:22:01,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 281 states have (on average 1.5266903914590748) internal successors, (429), 282 states have internal predecessors, (429), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 14:22:01,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 561 transitions. [2025-01-09 14:22:01,596 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 561 transitions. Word has length 297 [2025-01-09 14:22:01,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:22:01,596 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 561 transitions. [2025-01-09 14:22:01,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:22:01,597 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 561 transitions. [2025-01-09 14:22:01,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-01-09 14:22:01,600 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:22:01,600 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:01,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:22:01,600 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:22:01,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:22:01,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1776229805, now seen corresponding path program 1 times [2025-01-09 14:22:01,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:22:01,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276715323] [2025-01-09 14:22:01,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:01,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:22:01,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-01-09 14:22:01,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-01-09 14:22:01,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:01,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:02,027 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:22:02,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:22:02,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276715323] [2025-01-09 14:22:02,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276715323] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:22:02,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:22:02,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:22:02,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39135510] [2025-01-09 14:22:02,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:22:02,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:22:02,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:22:02,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:22:02,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:22:02,031 INFO L87 Difference]: Start difference. First operand 350 states and 561 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:22:02,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:22:02,070 INFO L93 Difference]: Finished difference Result 701 states and 1127 transitions. [2025-01-09 14:22:02,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:22:02,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 297 [2025-01-09 14:22:02,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:22:02,075 INFO L225 Difference]: With dead ends: 701 [2025-01-09 14:22:02,076 INFO L226 Difference]: Without dead ends: 354 [2025-01-09 14:22:02,077 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:22:02,078 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 0 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:22:02,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 532 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:22:02,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-01-09 14:22:02,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2025-01-09 14:22:02,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 285 states have (on average 1.5192982456140351) internal successors, (433), 286 states have internal predecessors, (433), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 14:22:02,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 565 transitions. [2025-01-09 14:22:02,104 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 565 transitions. Word has length 297 [2025-01-09 14:22:02,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:22:02,104 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 565 transitions. [2025-01-09 14:22:02,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:22:02,105 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 565 transitions. [2025-01-09 14:22:02,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-01-09 14:22:02,107 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:22:02,108 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:02,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:22:02,108 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:22:02,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:22:02,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1116698283, now seen corresponding path program 1 times [2025-01-09 14:22:02,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:22:02,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653449013] [2025-01-09 14:22:02,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:02,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:22:02,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-01-09 14:22:02,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-01-09 14:22:02,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:02,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:02,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:22:02,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:22:02,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653449013] [2025-01-09 14:22:02,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653449013] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:22:02,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:22:02,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:22:02,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042447524] [2025-01-09 14:22:02,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:22:02,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:22:02,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:22:02,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:22:02,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:22:02,847 INFO L87 Difference]: Start difference. First operand 354 states and 565 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:22:03,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:22:03,255 INFO L93 Difference]: Finished difference Result 896 states and 1427 transitions. [2025-01-09 14:22:03,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:22:03,255 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 297 [2025-01-09 14:22:03,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:22:03,262 INFO L225 Difference]: With dead ends: 896 [2025-01-09 14:22:03,262 INFO L226 Difference]: Without dead ends: 545 [2025-01-09 14:22:03,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:22:03,263 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 179 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:22:03,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 684 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:22:03,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-01-09 14:22:03,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 392. [2025-01-09 14:22:03,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 323 states have (on average 1.5325077399380804) internal successors, (495), 324 states have internal predecessors, (495), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 14:22:03,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 627 transitions. [2025-01-09 14:22:03,291 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 627 transitions. Word has length 297 [2025-01-09 14:22:03,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:22:03,291 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 627 transitions. [2025-01-09 14:22:03,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:22:03,291 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 627 transitions. [2025-01-09 14:22:03,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-01-09 14:22:03,294 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:22:03,294 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:03,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:22:03,294 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:22:03,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:22:03,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1154632099, now seen corresponding path program 1 times [2025-01-09 14:22:03,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:22:03,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178571812] [2025-01-09 14:22:03,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:03,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:22:03,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-01-09 14:22:03,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-01-09 14:22:03,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:03,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:03,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:22:03,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:22:03,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178571812] [2025-01-09 14:22:03,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178571812] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:22:03,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:22:03,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:22:03,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480582054] [2025-01-09 14:22:03,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:22:03,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:22:03,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:22:03,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:22:03,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:22:03,793 INFO L87 Difference]: Start difference. First operand 392 states and 627 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:22:03,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:22:03,858 INFO L93 Difference]: Finished difference Result 781 states and 1251 transitions. [2025-01-09 14:22:03,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:22:03,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 297 [2025-01-09 14:22:03,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:22:03,862 INFO L225 Difference]: With dead ends: 781 [2025-01-09 14:22:03,862 INFO L226 Difference]: Without dead ends: 392 [2025-01-09 14:22:03,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:22:03,863 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 0 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:22:03,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 781 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:22:03,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-01-09 14:22:03,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-01-09 14:22:03,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 323 states have (on average 1.5263157894736843) internal successors, (493), 324 states have internal predecessors, (493), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 14:22:03,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 625 transitions. [2025-01-09 14:22:03,881 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 625 transitions. Word has length 297 [2025-01-09 14:22:03,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:22:03,882 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 625 transitions. [2025-01-09 14:22:03,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:22:03,882 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 625 transitions. [2025-01-09 14:22:03,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-01-09 14:22:03,884 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:22:03,885 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:03,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:22:03,885 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:22:03,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:22:03,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1577333925, now seen corresponding path program 1 times [2025-01-09 14:22:03,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:22:03,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299656044] [2025-01-09 14:22:03,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:03,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:22:03,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-01-09 14:22:04,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-01-09 14:22:04,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:04,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:04,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 30 proven. 96 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-01-09 14:22:04,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:22:04,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299656044] [2025-01-09 14:22:04,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299656044] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:22:04,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246536550] [2025-01-09 14:22:04,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:04,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:22:04,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:22:04,761 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:22:04,763 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:22:04,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-01-09 14:22:04,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-01-09 14:22:04,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:04,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:04,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 14:22:04,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:22:05,207 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 588 proven. 9 refuted. 0 times theorem prover too weak. 3015 trivial. 0 not checked. [2025-01-09 14:22:05,208 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:22:05,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 117 proven. 9 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-01-09 14:22:05,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246536550] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:22:05,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:22:05,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 6] total 12 [2025-01-09 14:22:05,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000199032] [2025-01-09 14:22:05,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:22:05,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 14:22:05,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:22:05,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 14:22:05,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-01-09 14:22:05,463 INFO L87 Difference]: Start difference. First operand 392 states and 625 transitions. Second operand has 12 states, 12 states have (on average 15.833333333333334) internal successors, (190), 12 states have internal predecessors, (190), 4 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (80), 4 states have call predecessors, (80), 4 states have call successors, (80) [2025-01-09 14:22:06,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:22:06,270 INFO L93 Difference]: Finished difference Result 1061 states and 1659 transitions. [2025-01-09 14:22:06,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 14:22:06,271 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 15.833333333333334) internal successors, (190), 12 states have internal predecessors, (190), 4 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (80), 4 states have call predecessors, (80), 4 states have call successors, (80) Word has length 297 [2025-01-09 14:22:06,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:22:06,274 INFO L225 Difference]: With dead ends: 1061 [2025-01-09 14:22:06,274 INFO L226 Difference]: Without dead ends: 672 [2025-01-09 14:22:06,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 589 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=234, Invalid=636, Unknown=0, NotChecked=0, Total=870 [2025-01-09 14:22:06,276 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 830 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 400 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 400 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:22:06,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [834 Valid, 1083 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [400 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:22:06,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-01-09 14:22:06,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 653. [2025-01-09 14:22:06,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 529 states have (on average 1.4650283553875236) internal successors, (775), 532 states have internal predecessors, (775), 114 states have call successors, (114), 9 states have call predecessors, (114), 9 states have return successors, (114), 111 states have call predecessors, (114), 114 states have call successors, (114) [2025-01-09 14:22:06,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 1003 transitions. [2025-01-09 14:22:06,316 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 1003 transitions. Word has length 297 [2025-01-09 14:22:06,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:22:06,316 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 1003 transitions. [2025-01-09 14:22:06,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.833333333333334) internal successors, (190), 12 states have internal predecessors, (190), 4 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (80), 4 states have call predecessors, (80), 4 states have call successors, (80) [2025-01-09 14:22:06,317 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 1003 transitions. [2025-01-09 14:22:06,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-01-09 14:22:06,320 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:22:06,320 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:06,328 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:22:06,520 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:22:06,520 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:22:06,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:22:06,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1453053452, now seen corresponding path program 1 times [2025-01-09 14:22:06,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:22:06,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134904619] [2025-01-09 14:22:06,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:06,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:22:06,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-01-09 14:22:06,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-01-09 14:22:06,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:06,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:19,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:22:19,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:22:19,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134904619] [2025-01-09 14:22:19,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134904619] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:22:19,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:22:19,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 14:22:19,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360809727] [2025-01-09 14:22:19,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:22:19,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 14:22:19,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:22:19,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 14:22:19,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-01-09 14:22:19,837 INFO L87 Difference]: Start difference. First operand 653 states and 1003 transitions. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2025-01-09 14:22:21,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:22:21,876 INFO L93 Difference]: Finished difference Result 3253 states and 4991 transitions. [2025-01-09 14:22:21,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 14:22:21,877 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) Word has length 299 [2025-01-09 14:22:21,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:22:21,885 INFO L225 Difference]: With dead ends: 3253 [2025-01-09 14:22:21,886 INFO L226 Difference]: Without dead ends: 2573 [2025-01-09 14:22:21,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2025-01-09 14:22:21,888 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 2280 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2280 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 1353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:22:21,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2280 Valid, 1498 Invalid, 1353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 14:22:21,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2025-01-09 14:22:21,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 889. [2025-01-09 14:22:21,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 715 states have (on average 1.4587412587412587) internal successors, (1043), 718 states have internal predecessors, (1043), 157 states have call successors, (157), 16 states have call predecessors, (157), 16 states have return successors, (157), 154 states have call predecessors, (157), 157 states have call successors, (157) [2025-01-09 14:22:21,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1357 transitions. [2025-01-09 14:22:21,950 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1357 transitions. Word has length 299 [2025-01-09 14:22:21,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:22:21,950 INFO L471 AbstractCegarLoop]: Abstraction has 889 states and 1357 transitions. [2025-01-09 14:22:21,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2025-01-09 14:22:21,950 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1357 transitions. [2025-01-09 14:22:21,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-01-09 14:22:21,954 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:22:21,954 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:21,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:22:21,955 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:22:21,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:22:21,955 INFO L85 PathProgramCache]: Analyzing trace with hash -66850058, now seen corresponding path program 1 times [2025-01-09 14:22:21,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:22:21,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581026201] [2025-01-09 14:22:21,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:21,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:22:21,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-01-09 14:22:22,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-01-09 14:22:22,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:22,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:22,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:22:22,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:22:22,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581026201] [2025-01-09 14:22:22,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581026201] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:22:22,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:22:22,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:22:22,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252383806] [2025-01-09 14:22:22,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:22:22,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:22:22,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:22:22,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:22:22,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:22:22,506 INFO L87 Difference]: Start difference. First operand 889 states and 1357 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, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:22:22,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:22:22,657 INFO L93 Difference]: Finished difference Result 1825 states and 2793 transitions. [2025-01-09 14:22:22,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:22:22,657 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, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 299 [2025-01-09 14:22:22,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:22:22,665 INFO L225 Difference]: With dead ends: 1825 [2025-01-09 14:22:22,666 INFO L226 Difference]: Without dead ends: 1079 [2025-01-09 14:22:22,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:22:22,670 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 239 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:22:22,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 562 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:22:22,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2025-01-09 14:22:22,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 893. [2025-01-09 14:22:22,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 719 states have (on average 1.4450625869262865) internal successors, (1039), 722 states have internal predecessors, (1039), 157 states have call successors, (157), 16 states have call predecessors, (157), 16 states have return successors, (157), 154 states have call predecessors, (157), 157 states have call successors, (157) [2025-01-09 14:22:22,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1353 transitions. [2025-01-09 14:22:22,715 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1353 transitions. Word has length 299 [2025-01-09 14:22:22,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:22:22,715 INFO L471 AbstractCegarLoop]: Abstraction has 893 states and 1353 transitions. [2025-01-09 14:22:22,715 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, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:22:22,715 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1353 transitions. [2025-01-09 14:22:22,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-01-09 14:22:22,718 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:22:22,718 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:22,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:22:22,718 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:22:22,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:22:22,719 INFO L85 PathProgramCache]: Analyzing trace with hash 153669558, now seen corresponding path program 1 times [2025-01-09 14:22:22,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:22:22,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228306621] [2025-01-09 14:22:22,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:22,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:22:22,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-01-09 14:22:22,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-01-09 14:22:22,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:22,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:26,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:22:26,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:22:26,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228306621] [2025-01-09 14:22:26,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228306621] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:22:26,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:22:26,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 14:22:26,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075223037] [2025-01-09 14:22:26,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:22:26,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:22:26,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:22:26,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:22:26,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:22:26,666 INFO L87 Difference]: Start difference. First operand 893 states and 1353 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 2 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2025-01-09 14:22:28,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:22:28,549 INFO L93 Difference]: Finished difference Result 3477 states and 5289 transitions. [2025-01-09 14:22:28,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 14:22:28,549 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 2 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) Word has length 299 [2025-01-09 14:22:28,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:22:28,560 INFO L225 Difference]: With dead ends: 3477 [2025-01-09 14:22:28,561 INFO L226 Difference]: Without dead ends: 2721 [2025-01-09 14:22:28,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-01-09 14:22:28,563 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 1329 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1329 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:22:28,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1329 Valid, 1335 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 14:22:28,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2721 states. [2025-01-09 14:22:28,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2721 to 929. [2025-01-09 14:22:28,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 753 states have (on average 1.4435590969455512) internal successors, (1087), 756 states have internal predecessors, (1087), 157 states have call successors, (157), 18 states have call predecessors, (157), 18 states have return successors, (157), 154 states have call predecessors, (157), 157 states have call successors, (157) [2025-01-09 14:22:28,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1401 transitions. [2025-01-09 14:22:28,612 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1401 transitions. Word has length 299 [2025-01-09 14:22:28,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:22:28,613 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1401 transitions. [2025-01-09 14:22:28,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 2 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2025-01-09 14:22:28,613 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1401 transitions. [2025-01-09 14:22:28,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-01-09 14:22:28,616 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:22:28,616 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:28,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:22:28,617 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:22:28,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:22:28,617 INFO L85 PathProgramCache]: Analyzing trace with hash 818450162, now seen corresponding path program 1 times [2025-01-09 14:22:28,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:22:28,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609412431] [2025-01-09 14:22:28,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:28,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:22:28,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-01-09 14:22:28,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-01-09 14:22:28,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:28,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:35,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:22:35,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:22:35,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609412431] [2025-01-09 14:22:35,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609412431] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:22:35,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:22:35,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 14:22:35,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123866224] [2025-01-09 14:22:35,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:22:35,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 14:22:35,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:22:35,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 14:22:35,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-01-09 14:22:35,823 INFO L87 Difference]: Start difference. First operand 929 states and 1401 transitions. Second operand has 16 states, 16 states have (on average 5.4375) internal successors, (87), 16 states have internal predecessors, (87), 5 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 5 states have call predecessors, (43), 5 states have call successors, (43) [2025-01-09 14:22:39,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:22:39,909 INFO L93 Difference]: Finished difference Result 4163 states and 6337 transitions. [2025-01-09 14:22:39,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 14:22:39,909 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.4375) internal successors, (87), 16 states have internal predecessors, (87), 5 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 5 states have call predecessors, (43), 5 states have call successors, (43) Word has length 299 [2025-01-09 14:22:39,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:22:39,920 INFO L225 Difference]: With dead ends: 4163 [2025-01-09 14:22:39,920 INFO L226 Difference]: Without dead ends: 3407 [2025-01-09 14:22:39,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=243, Invalid=627, Unknown=0, NotChecked=0, Total=870 [2025-01-09 14:22:39,923 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 3490 mSDsluCounter, 1486 mSDsCounter, 0 mSdLazyCounter, 1610 mSolverCounterSat, 340 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3490 SdHoareTripleChecker+Valid, 1726 SdHoareTripleChecker+Invalid, 1950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 340 IncrementalHoareTripleChecker+Valid, 1610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:22:39,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3490 Valid, 1726 Invalid, 1950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [340 Valid, 1610 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 14:22:39,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3407 states. [2025-01-09 14:22:39,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3407 to 973. [2025-01-09 14:22:39,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 796 states have (on average 1.4484924623115578) internal successors, (1153), 799 states have internal predecessors, (1153), 157 states have call successors, (157), 19 states have call predecessors, (157), 19 states have return successors, (157), 154 states have call predecessors, (157), 157 states have call successors, (157) [2025-01-09 14:22:39,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1467 transitions. [2025-01-09 14:22:39,980 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1467 transitions. Word has length 299 [2025-01-09 14:22:39,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:22:39,980 INFO L471 AbstractCegarLoop]: Abstraction has 973 states and 1467 transitions. [2025-01-09 14:22:39,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.4375) internal successors, (87), 16 states have internal predecessors, (87), 5 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 5 states have call predecessors, (43), 5 states have call successors, (43) [2025-01-09 14:22:39,980 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1467 transitions. [2025-01-09 14:22:39,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-01-09 14:22:39,982 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:22:39,982 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:39,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:22:39,983 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:22:39,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:22:39,983 INFO L85 PathProgramCache]: Analyzing trace with hash -2090313740, now seen corresponding path program 1 times [2025-01-09 14:22:39,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:22:39,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938953093] [2025-01-09 14:22:39,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:39,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:22:39,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-01-09 14:22:40,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-01-09 14:22:40,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:40,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:23:09,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:23:09,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:23:09,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938953093] [2025-01-09 14:23:09,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938953093] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:23:09,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:23:09,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 14:23:09,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981549110] [2025-01-09 14:23:09,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:23:09,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 14:23:09,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:23:09,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 14:23:09,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:23:09,472 INFO L87 Difference]: Start difference. First operand 973 states and 1467 transitions. Second operand has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 2 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2025-01-09 14:23:12,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:23:12,098 INFO L93 Difference]: Finished difference Result 3607 states and 5503 transitions. [2025-01-09 14:23:12,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 14:23:12,102 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 2 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) Word has length 299 [2025-01-09 14:23:12,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:23:12,119 INFO L225 Difference]: With dead ends: 3607 [2025-01-09 14:23:12,122 INFO L226 Difference]: Without dead ends: 2863 [2025-01-09 14:23:12,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2025-01-09 14:23:12,130 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 1651 mSDsluCounter, 1309 mSDsCounter, 0 mSdLazyCounter, 1093 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1651 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 1093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 14:23:12,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1651 Valid, 1566 Invalid, 1285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 1093 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 14:23:12,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2863 states. [2025-01-09 14:23:12,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2863 to 1217. [2025-01-09 14:23:12,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1217 states, 1040 states have (on average 1.4701923076923078) internal successors, (1529), 1043 states have internal predecessors, (1529), 157 states have call successors, (157), 19 states have call predecessors, (157), 19 states have return successors, (157), 154 states have call predecessors, (157), 157 states have call successors, (157) [2025-01-09 14:23:12,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1843 transitions. [2025-01-09 14:23:12,237 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1843 transitions. Word has length 299 [2025-01-09 14:23:12,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:23:12,241 INFO L471 AbstractCegarLoop]: Abstraction has 1217 states and 1843 transitions. [2025-01-09 14:23:12,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 2 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2025-01-09 14:23:12,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1843 transitions. [2025-01-09 14:23:12,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-01-09 14:23:12,244 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:23:12,244 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:12,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:23:12,244 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:23:12,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:23:12,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1248052554, now seen corresponding path program 1 times [2025-01-09 14:23:12,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:23:12,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928374306] [2025-01-09 14:23:12,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:23:12,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:23:12,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-01-09 14:23:12,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-01-09 14:23:12,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:23:12,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:23:21,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:23:21,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:23:21,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928374306] [2025-01-09 14:23:21,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928374306] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:23:21,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:23:21,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 14:23:21,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245097240] [2025-01-09 14:23:21,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:23:21,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 14:23:21,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:23:21,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 14:23:21,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:23:21,489 INFO L87 Difference]: Start difference. First operand 1217 states and 1843 transitions. Second operand has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2025-01-09 14:23:23,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:23:23,212 INFO L93 Difference]: Finished difference Result 3507 states and 5303 transitions. [2025-01-09 14:23:23,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 14:23:23,212 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) Word has length 299 [2025-01-09 14:23:23,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:23:23,222 INFO L225 Difference]: With dead ends: 3507 [2025-01-09 14:23:23,222 INFO L226 Difference]: Without dead ends: 2751 [2025-01-09 14:23:23,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2025-01-09 14:23:23,224 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 1619 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1619 SdHoareTripleChecker+Valid, 1780 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:23:23,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1619 Valid, 1780 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 14:23:23,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2751 states. [2025-01-09 14:23:23,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2751 to 1733. [2025-01-09 14:23:23,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1540 states have (on average 1.4857142857142858) internal successors, (2288), 1547 states have internal predecessors, (2288), 169 states have call successors, (169), 23 states have call predecessors, (169), 23 states have return successors, (169), 162 states have call predecessors, (169), 169 states have call successors, (169) [2025-01-09 14:23:23,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2626 transitions. [2025-01-09 14:23:23,292 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2626 transitions. Word has length 299 [2025-01-09 14:23:23,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:23:23,294 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2626 transitions. [2025-01-09 14:23:23,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2025-01-09 14:23:23,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2626 transitions. [2025-01-09 14:23:23,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-01-09 14:23:23,297 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:23:23,298 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:23,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:23:23,298 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:23:23,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:23:23,299 INFO L85 PathProgramCache]: Analyzing trace with hash 138150840, now seen corresponding path program 1 times [2025-01-09 14:23:23,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:23:23,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694954608] [2025-01-09 14:23:23,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:23:23,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:23:23,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-01-09 14:23:23,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-01-09 14:23:23,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:23:23,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat