./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-31.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-31.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 a7443a0a8cb83ad1cb418009a7dc67d45dd495b9ce5249e0f3a79a6d2936d9f0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:45:40,561 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:45:40,617 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:45:40,622 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:45:40,622 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:45:40,653 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:45:40,654 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:45:40,654 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:45:40,654 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:45:40,654 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:45:40,654 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:45:40,655 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:45:40,655 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:45:40,655 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:45:40,655 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:45:40,655 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:45:40,655 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:45:40,656 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:45:40,656 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:45:40,656 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:45:40,656 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:45:40,656 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:45:40,656 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:45:40,656 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:45:40,656 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:45:40,657 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:45:40,657 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:45:40,657 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:45:40,657 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:45:40,657 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:45:40,657 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:45:40,657 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:45:40,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:45:40,658 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:45:40,658 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:45:40,658 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:45:40,658 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:45:40,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:45:40,658 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:45:40,658 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:45:40,658 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:45:40,658 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:45:40,659 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:45:40,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:45:40,659 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:45:40,659 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:45:40,659 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:45:40,659 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:45:40,659 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 -> a7443a0a8cb83ad1cb418009a7dc67d45dd495b9ce5249e0f3a79a6d2936d9f0 [2025-01-09 14:45:40,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:45:40,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:45:40,921 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:45:40,924 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:45:40,925 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:45:40,926 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-31.i [2025-01-09 14:45:42,352 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f22a57425/19b76bb8204d46e9972f85fa908e5c4e/FLAGd2df15833 [2025-01-09 14:45:42,705 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:45:42,708 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-31.i [2025-01-09 14:45:42,723 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f22a57425/19b76bb8204d46e9972f85fa908e5c4e/FLAGd2df15833 [2025-01-09 14:45:42,740 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f22a57425/19b76bb8204d46e9972f85fa908e5c4e [2025-01-09 14:45:42,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:45:42,744 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:45:42,746 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:45:42,746 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:45:42,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:45:42,752 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:45:42" (1/1) ... [2025-01-09 14:45:42,752 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40f62123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:42, skipping insertion in model container [2025-01-09 14:45:42,752 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:45:42" (1/1) ... [2025-01-09 14:45:42,799 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:45:42,930 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-31.i[916,929] [2025-01-09 14:45:43,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:45:43,158 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:45:43,166 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-31.i[916,929] [2025-01-09 14:45:43,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:45:43,326 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:45:43,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:43 WrapperNode [2025-01-09 14:45:43,327 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:45:43,328 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:45:43,328 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:45:43,328 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:45:43,333 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:45:43" (1/1) ... [2025-01-09 14:45:43,357 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:45:43" (1/1) ... [2025-01-09 14:45:43,507 INFO L138 Inliner]: procedures = 26, calls = 105, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 909 [2025-01-09 14:45:43,508 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:45:43,509 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:45:43,509 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:45:43,509 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:45:43,518 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:43" (1/1) ... [2025-01-09 14:45:43,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:43" (1/1) ... [2025-01-09 14:45:43,552 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:43" (1/1) ... [2025-01-09 14:45:43,663 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:45:43,664 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:43" (1/1) ... [2025-01-09 14:45:43,664 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:43" (1/1) ... [2025-01-09 14:45:43,706 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:43" (1/1) ... [2025-01-09 14:45:43,717 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:43" (1/1) ... [2025-01-09 14:45:43,731 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:43" (1/1) ... [2025-01-09 14:45:43,753 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:43" (1/1) ... [2025-01-09 14:45:43,765 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:43" (1/1) ... [2025-01-09 14:45:43,790 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:45:43,792 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:45:43,792 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:45:43,792 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:45:43,793 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:43" (1/1) ... [2025-01-09 14:45:43,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:45:43,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:45:43,826 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:45:43,831 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:45:43,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:45:43,855 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:45:43,855 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:45:43,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:45:43,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:45:43,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:45:44,016 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:45:44,018 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:45:45,737 INFO L? ?]: Removed 102 outVars from TransFormulas that were not future-live. [2025-01-09 14:45:45,738 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:45:45,760 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:45:45,760 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:45:45,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:45:45 BoogieIcfgContainer [2025-01-09 14:45:45,761 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:45:45,766 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:45:45,767 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:45:45,771 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:45:45,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:45:42" (1/3) ... [2025-01-09 14:45:45,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22eb87d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:45:45, skipping insertion in model container [2025-01-09 14:45:45,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:43" (2/3) ... [2025-01-09 14:45:45,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22eb87d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:45:45, skipping insertion in model container [2025-01-09 14:45:45,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:45:45" (3/3) ... [2025-01-09 14:45:45,776 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-31.i [2025-01-09 14:45:45,791 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:45:45,794 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-31.i that has 2 procedures, 362 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:45:45,874 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:45:45,884 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;@6a116bb6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:45:45,884 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:45:45,889 INFO L276 IsEmpty]: Start isEmpty. Operand has 362 states, 267 states have (on average 1.5205992509363295) internal successors, (406), 268 states have internal predecessors, (406), 92 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 14:45:45,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2025-01-09 14:45:45,921 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:45,922 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:45:45,922 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:45,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:45,928 INFO L85 PathProgramCache]: Analyzing trace with hash -532616409, now seen corresponding path program 1 times [2025-01-09 14:45:45,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:45,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657370815] [2025-01-09 14:45:45,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:45,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:46,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 604 statements into 1 equivalence classes. [2025-01-09 14:45:46,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 604 of 604 statements. [2025-01-09 14:45:46,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:46,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:46,755 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 16562 trivial. 0 not checked. [2025-01-09 14:45:46,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:46,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657370815] [2025-01-09 14:45:46,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657370815] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:45:46,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371081136] [2025-01-09 14:45:46,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:46,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:45:46,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:45:46,761 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:45:46,764 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:45:46,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 604 statements into 1 equivalence classes. [2025-01-09 14:45:47,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 604 of 604 statements. [2025-01-09 14:45:47,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:47,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:47,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 1439 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:45:47,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:45:47,371 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 16562 trivial. 0 not checked. [2025-01-09 14:45:47,372 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:45:47,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371081136] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:47,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:45:47,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:45:47,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086433941] [2025-01-09 14:45:47,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:47,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:45:47,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:47,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:45:47,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:45:47,407 INFO L87 Difference]: Start difference. First operand has 362 states, 267 states have (on average 1.5205992509363295) internal successors, (406), 268 states have internal predecessors, (406), 92 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) Second operand has 2 states, 2 states have (on average 74.5) internal successors, (149), 2 states have internal predecessors, (149), 2 states have call successors, (92), 2 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 2 states have call successors, (92) [2025-01-09 14:45:47,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:47,496 INFO L93 Difference]: Finished difference Result 718 states and 1267 transitions. [2025-01-09 14:45:47,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:45:47,498 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 74.5) internal successors, (149), 2 states have internal predecessors, (149), 2 states have call successors, (92), 2 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 2 states have call successors, (92) Word has length 604 [2025-01-09 14:45:47,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:47,509 INFO L225 Difference]: With dead ends: 718 [2025-01-09 14:45:47,510 INFO L226 Difference]: Without dead ends: 359 [2025-01-09 14:45:47,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 605 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:45:47,522 INFO L435 NwaCegarLoop]: 582 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, 582 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:45:47,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:45:47,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-01-09 14:45:47,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2025-01-09 14:45:47,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 265 states have (on average 1.5018867924528303) internal successors, (398), 265 states have internal predecessors, (398), 92 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 14:45:47,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 582 transitions. [2025-01-09 14:45:47,616 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 582 transitions. Word has length 604 [2025-01-09 14:45:47,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:47,618 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 582 transitions. [2025-01-09 14:45:47,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 74.5) internal successors, (149), 2 states have internal predecessors, (149), 2 states have call successors, (92), 2 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 2 states have call successors, (92) [2025-01-09 14:45:47,619 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 582 transitions. [2025-01-09 14:45:47,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2025-01-09 14:45:47,654 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:47,654 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:45:47,667 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:45:47,855 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:45:47,856 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:47,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:47,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1358178033, now seen corresponding path program 1 times [2025-01-09 14:45:47,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:47,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639923365] [2025-01-09 14:45:47,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:47,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:47,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 604 statements into 1 equivalence classes. [2025-01-09 14:45:48,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 604 of 604 statements. [2025-01-09 14:45:48,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:48,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:49,254 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-01-09 14:45:49,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:49,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639923365] [2025-01-09 14:45:49,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639923365] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:49,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:49,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:45:49,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198172474] [2025-01-09 14:45:49,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:49,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:45:49,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:49,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:45:49,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:45:49,262 INFO L87 Difference]: Start difference. First operand 359 states and 582 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 14:45:49,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:49,816 INFO L93 Difference]: Finished difference Result 1072 states and 1741 transitions. [2025-01-09 14:45:49,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:45:49,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 604 [2025-01-09 14:45:49,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:49,831 INFO L225 Difference]: With dead ends: 1072 [2025-01-09 14:45:49,832 INFO L226 Difference]: Without dead ends: 716 [2025-01-09 14:45:49,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:45:49,836 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 590 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:49,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 1693 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:45:49,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-01-09 14:45:50,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 697. [2025-01-09 14:45:50,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 510 states have (on average 1.503921568627451) internal successors, (767), 510 states have internal predecessors, (767), 184 states have call successors, (184), 2 states have call predecessors, (184), 2 states have return successors, (184), 184 states have call predecessors, (184), 184 states have call successors, (184) [2025-01-09 14:45:50,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1135 transitions. [2025-01-09 14:45:50,010 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1135 transitions. Word has length 604 [2025-01-09 14:45:50,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:50,015 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 1135 transitions. [2025-01-09 14:45:50,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 14:45:50,016 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1135 transitions. [2025-01-09 14:45:50,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 606 [2025-01-09 14:45:50,029 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:50,030 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:45:50,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:45:50,032 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:50,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:50,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1310921844, now seen corresponding path program 1 times [2025-01-09 14:45:50,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:50,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999629650] [2025-01-09 14:45:50,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:50,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:50,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 605 statements into 1 equivalence classes. [2025-01-09 14:45:50,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 605 of 605 statements. [2025-01-09 14:45:50,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:50,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:50,965 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 273 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-01-09 14:45:50,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:50,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999629650] [2025-01-09 14:45:50,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999629650] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:45:50,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200114675] [2025-01-09 14:45:50,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:50,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:45:50,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:45:50,972 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:45:50,974 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:45:51,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 605 statements into 1 equivalence classes. [2025-01-09 14:45:51,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 605 of 605 statements. [2025-01-09 14:45:51,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:51,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:51,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 1440 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 14:45:51,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:45:52,261 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-01-09 14:45:52,262 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:45:52,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200114675] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:52,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:45:52,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-01-09 14:45:52,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591989037] [2025-01-09 14:45:52,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:52,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:45:52,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:52,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:45:52,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:45:52,265 INFO L87 Difference]: Start difference. First operand 697 states and 1135 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 14:45:52,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:52,734 INFO L93 Difference]: Finished difference Result 1254 states and 2043 transitions. [2025-01-09 14:45:52,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:45:52,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 605 [2025-01-09 14:45:52,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:52,741 INFO L225 Difference]: With dead ends: 1254 [2025-01-09 14:45:52,741 INFO L226 Difference]: Without dead ends: 716 [2025-01-09 14:45:52,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 604 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:45:52,748 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 397 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 1696 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:52,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 1696 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:45:52,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-01-09 14:45:52,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 698. [2025-01-09 14:45:52,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 511 states have (on average 1.5009784735812133) internal successors, (767), 511 states have internal predecessors, (767), 184 states have call successors, (184), 2 states have call predecessors, (184), 2 states have return successors, (184), 184 states have call predecessors, (184), 184 states have call successors, (184) [2025-01-09 14:45:52,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1135 transitions. [2025-01-09 14:45:52,853 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1135 transitions. Word has length 605 [2025-01-09 14:45:52,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:52,855 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 1135 transitions. [2025-01-09 14:45:52,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 14:45:52,855 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1135 transitions. [2025-01-09 14:45:52,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2025-01-09 14:45:52,867 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:52,868 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:45:52,879 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:45:53,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:45:53,072 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:53,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:53,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1597223884, now seen corresponding path program 1 times [2025-01-09 14:45:53,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:53,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375023953] [2025-01-09 14:45:53,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:53,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:53,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 606 statements into 1 equivalence classes. [2025-01-09 14:45:53,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 606 of 606 statements. [2025-01-09 14:45:53,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:53,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:53,784 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-01-09 14:45:53,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:53,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375023953] [2025-01-09 14:45:53,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375023953] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:53,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:53,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:45:53,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730977977] [2025-01-09 14:45:53,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:53,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:45:53,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:53,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:45:53,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:45:53,789 INFO L87 Difference]: Start difference. First operand 698 states and 1135 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 14:45:54,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:54,303 INFO L93 Difference]: Finished difference Result 1437 states and 2348 transitions. [2025-01-09 14:45:54,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:45:54,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 606 [2025-01-09 14:45:54,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:54,310 INFO L225 Difference]: With dead ends: 1437 [2025-01-09 14:45:54,311 INFO L226 Difference]: Without dead ends: 898 [2025-01-09 14:45:54,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:45:54,314 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 401 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 1677 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:54,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 1677 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:45:54,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2025-01-09 14:45:54,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 882. [2025-01-09 14:45:54,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 695 states have (on average 1.5453237410071943) internal successors, (1074), 695 states have internal predecessors, (1074), 184 states have call successors, (184), 2 states have call predecessors, (184), 2 states have return successors, (184), 184 states have call predecessors, (184), 184 states have call successors, (184) [2025-01-09 14:45:54,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1442 transitions. [2025-01-09 14:45:54,386 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1442 transitions. Word has length 606 [2025-01-09 14:45:54,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:54,387 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1442 transitions. [2025-01-09 14:45:54,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 14:45:54,388 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1442 transitions. [2025-01-09 14:45:54,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2025-01-09 14:45:54,398 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:54,400 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:45:54,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:45:54,400 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:54,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:54,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1215411953, now seen corresponding path program 1 times [2025-01-09 14:45:54,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:54,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458151683] [2025-01-09 14:45:54,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:54,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:54,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 607 statements into 1 equivalence classes. [2025-01-09 14:45:54,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 607 of 607 statements. [2025-01-09 14:45:54,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:54,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:54,736 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-01-09 14:45:54,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:54,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458151683] [2025-01-09 14:45:54,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458151683] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:54,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:54,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:45:54,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711348716] [2025-01-09 14:45:54,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:54,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:45:54,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:54,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:45:54,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:45:54,739 INFO L87 Difference]: Start difference. First operand 882 states and 1442 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 14:45:54,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:54,839 INFO L93 Difference]: Finished difference Result 2108 states and 3445 transitions. [2025-01-09 14:45:54,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:45:54,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 607 [2025-01-09 14:45:54,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:54,851 INFO L225 Difference]: With dead ends: 2108 [2025-01-09 14:45:54,851 INFO L226 Difference]: Without dead ends: 1422 [2025-01-09 14:45:54,853 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:45:54,854 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 390 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:54,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 1273 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:45:54,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2025-01-09 14:45:54,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1419. [2025-01-09 14:45:54,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1419 states, 1184 states have (on average 1.5641891891891893) internal successors, (1852), 1185 states have internal predecessors, (1852), 231 states have call successors, (231), 3 states have call predecessors, (231), 3 states have return successors, (231), 230 states have call predecessors, (231), 231 states have call successors, (231) [2025-01-09 14:45:54,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 2314 transitions. [2025-01-09 14:45:54,955 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 2314 transitions. Word has length 607 [2025-01-09 14:45:54,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:54,957 INFO L471 AbstractCegarLoop]: Abstraction has 1419 states and 2314 transitions. [2025-01-09 14:45:54,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 14:45:54,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 2314 transitions. [2025-01-09 14:45:54,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2025-01-09 14:45:54,968 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:54,969 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:45:54,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:45:54,969 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:54,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:54,970 INFO L85 PathProgramCache]: Analyzing trace with hash 741773, now seen corresponding path program 1 times [2025-01-09 14:45:54,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:54,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281619279] [2025-01-09 14:45:54,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:54,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:55,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 607 statements into 1 equivalence classes. [2025-01-09 14:45:55,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 607 of 607 statements. [2025-01-09 14:45:55,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:55,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:55,307 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-01-09 14:45:55,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:55,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281619279] [2025-01-09 14:45:55,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281619279] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:55,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:55,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:45:55,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629306449] [2025-01-09 14:45:55,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:55,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:45:55,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:55,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:45:55,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:45:55,311 INFO L87 Difference]: Start difference. First operand 1419 states and 2314 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 14:45:55,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:55,455 INFO L93 Difference]: Finished difference Result 3653 states and 5939 transitions. [2025-01-09 14:45:55,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:45:55,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 607 [2025-01-09 14:45:55,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:55,474 INFO L225 Difference]: With dead ends: 3653 [2025-01-09 14:45:55,475 INFO L226 Difference]: Without dead ends: 2543 [2025-01-09 14:45:55,479 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:45:55,480 INFO L435 NwaCegarLoop]: 734 mSDtfsCounter, 374 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:55,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 1296 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:45:55,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2543 states. [2025-01-09 14:45:55,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2543 to 2539. [2025-01-09 14:45:55,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2539 states, 2219 states have (on average 1.5804416403785488) internal successors, (3507), 2222 states have internal predecessors, (3507), 313 states have call successors, (313), 6 states have call predecessors, (313), 6 states have return successors, (313), 310 states have call predecessors, (313), 313 states have call successors, (313) [2025-01-09 14:45:55,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2539 states to 2539 states and 4133 transitions. [2025-01-09 14:45:55,643 INFO L78 Accepts]: Start accepts. Automaton has 2539 states and 4133 transitions. Word has length 607 [2025-01-09 14:45:55,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:55,645 INFO L471 AbstractCegarLoop]: Abstraction has 2539 states and 4133 transitions. [2025-01-09 14:45:55,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 14:45:55,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2539 states and 4133 transitions. [2025-01-09 14:45:55,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2025-01-09 14:45:55,652 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:55,652 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:45:55,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:45:55,653 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:55,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:55,654 INFO L85 PathProgramCache]: Analyzing trace with hash -2076595125, now seen corresponding path program 1 times [2025-01-09 14:45:55,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:55,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370684294] [2025-01-09 14:45:55,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:55,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:55,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 607 statements into 1 equivalence classes. [2025-01-09 14:45:55,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 607 of 607 statements. [2025-01-09 14:45:55,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:55,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:55,978 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-01-09 14:45:55,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:55,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370684294] [2025-01-09 14:45:55,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370684294] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:55,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:55,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:45:55,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090250212] [2025-01-09 14:45:55,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:55,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:45:55,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:55,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:45:55,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:45:55,981 INFO L87 Difference]: Start difference. First operand 2539 states and 4133 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 14:45:56,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:56,143 INFO L93 Difference]: Finished difference Result 6551 states and 10577 transitions. [2025-01-09 14:45:56,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:45:56,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 607 [2025-01-09 14:45:56,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:56,170 INFO L225 Difference]: With dead ends: 6551 [2025-01-09 14:45:56,170 INFO L226 Difference]: Without dead ends: 4471 [2025-01-09 14:45:56,177 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:45:56,178 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 531 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:56,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 1176 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:45:56,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4471 states. [2025-01-09 14:45:56,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4471 to 2635. [2025-01-09 14:45:56,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2635 states, 2315 states have (on average 1.5848812095032399) internal successors, (3669), 2318 states have internal predecessors, (3669), 313 states have call successors, (313), 6 states have call predecessors, (313), 6 states have return successors, (313), 310 states have call predecessors, (313), 313 states have call successors, (313) [2025-01-09 14:45:56,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 4295 transitions. [2025-01-09 14:45:56,371 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 4295 transitions. Word has length 607 [2025-01-09 14:45:56,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:56,372 INFO L471 AbstractCegarLoop]: Abstraction has 2635 states and 4295 transitions. [2025-01-09 14:45:56,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 14:45:56,372 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 4295 transitions. [2025-01-09 14:45:56,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2025-01-09 14:45:56,378 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:56,378 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:45:56,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:45:56,379 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:56,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:56,379 INFO L85 PathProgramCache]: Analyzing trace with hash 373005005, now seen corresponding path program 1 times [2025-01-09 14:45:56,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:56,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227766078] [2025-01-09 14:45:56,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:56,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:56,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 607 statements into 1 equivalence classes. [2025-01-09 14:45:56,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 607 of 607 statements. [2025-01-09 14:45:56,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:56,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:56,667 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-01-09 14:45:56,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:56,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227766078] [2025-01-09 14:45:56,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227766078] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:56,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:56,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:45:56,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675293543] [2025-01-09 14:45:56,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:56,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:45:56,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:56,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:45:56,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:45:56,670 INFO L87 Difference]: Start difference. First operand 2635 states and 4295 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 14:45:56,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:56,832 INFO L93 Difference]: Finished difference Result 6927 states and 11239 transitions. [2025-01-09 14:45:56,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:45:56,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 607 [2025-01-09 14:45:56,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:56,859 INFO L225 Difference]: With dead ends: 6927 [2025-01-09 14:45:56,860 INFO L226 Difference]: Without dead ends: 4747 [2025-01-09 14:45:56,868 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:45:56,868 INFO L435 NwaCegarLoop]: 989 mSDtfsCounter, 560 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 1556 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:56,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 1556 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:45:56,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4747 states. [2025-01-09 14:45:57,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4747 to 3127. [2025-01-09 14:45:57,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3127 states, 2807 states have (on average 1.6148913430708942) internal successors, (4533), 2810 states have internal predecessors, (4533), 313 states have call successors, (313), 6 states have call predecessors, (313), 6 states have return successors, (313), 310 states have call predecessors, (313), 313 states have call successors, (313) [2025-01-09 14:45:57,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 5159 transitions. [2025-01-09 14:45:57,076 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 5159 transitions. Word has length 607 [2025-01-09 14:45:57,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:57,078 INFO L471 AbstractCegarLoop]: Abstraction has 3127 states and 5159 transitions. [2025-01-09 14:45:57,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 14:45:57,079 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 5159 transitions. [2025-01-09 14:45:57,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2025-01-09 14:45:57,084 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:57,085 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:45:57,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:45:57,085 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:57,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:57,086 INFO L85 PathProgramCache]: Analyzing trace with hash 513553615, now seen corresponding path program 1 times [2025-01-09 14:45:57,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:57,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791003294] [2025-01-09 14:45:57,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:57,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:57,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 607 statements into 1 equivalence classes. [2025-01-09 14:45:57,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 607 of 607 statements. [2025-01-09 14:45:57,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:57,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:58,667 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-01-09 14:45:58,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:58,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791003294] [2025-01-09 14:45:58,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791003294] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:58,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:58,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:45:58,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968297750] [2025-01-09 14:45:58,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:58,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:45:58,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:58,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:45:58,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:45:58,670 INFO L87 Difference]: Start difference. First operand 3127 states and 5159 transitions. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 14:45:59,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:59,411 INFO L93 Difference]: Finished difference Result 10226 states and 16883 transitions. [2025-01-09 14:45:59,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:45:59,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 607 [2025-01-09 14:45:59,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:59,457 INFO L225 Difference]: With dead ends: 10226 [2025-01-09 14:45:59,458 INFO L226 Difference]: Without dead ends: 7277 [2025-01-09 14:45:59,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:45:59,470 INFO L435 NwaCegarLoop]: 870 mSDtfsCounter, 712 mSDsluCounter, 1840 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 2710 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:59,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 2710 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:45:59,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7277 states. [2025-01-09 14:45:59,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7277 to 6721. [2025-01-09 14:45:59,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6721 states, 6249 states have (on average 1.6282605216834694) internal successors, (10175), 6256 states have internal predecessors, (10175), 461 states have call successors, (461), 10 states have call predecessors, (461), 10 states have return successors, (461), 454 states have call predecessors, (461), 461 states have call successors, (461) [2025-01-09 14:45:59,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6721 states to 6721 states and 11097 transitions. [2025-01-09 14:45:59,758 INFO L78 Accepts]: Start accepts. Automaton has 6721 states and 11097 transitions. Word has length 607 [2025-01-09 14:45:59,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:59,759 INFO L471 AbstractCegarLoop]: Abstraction has 6721 states and 11097 transitions. [2025-01-09 14:45:59,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 14:45:59,760 INFO L276 IsEmpty]: Start isEmpty. Operand 6721 states and 11097 transitions. [2025-01-09 14:45:59,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2025-01-09 14:45:59,774 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:59,774 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:45:59,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:45:59,775 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:59,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:59,776 INFO L85 PathProgramCache]: Analyzing trace with hash 251340047, now seen corresponding path program 1 times [2025-01-09 14:45:59,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:59,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045819392] [2025-01-09 14:45:59,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:59,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:59,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 607 statements into 1 equivalence classes. [2025-01-09 14:46:00,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 607 of 607 statements. [2025-01-09 14:46:00,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:00,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:00,855 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-01-09 14:46:00,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:00,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045819392] [2025-01-09 14:46:00,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045819392] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:00,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:00,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:46:00,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583227731] [2025-01-09 14:46:00,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:00,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:46:00,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:00,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:46:00,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:46:00,858 INFO L87 Difference]: Start difference. First operand 6721 states and 11097 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 14:46:01,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:01,195 INFO L93 Difference]: Finished difference Result 19327 states and 31921 transitions. [2025-01-09 14:46:01,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:46:01,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 607 [2025-01-09 14:46:01,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:01,245 INFO L225 Difference]: With dead ends: 19327 [2025-01-09 14:46:01,245 INFO L226 Difference]: Without dead ends: 13191 [2025-01-09 14:46:01,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:46:01,264 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 391 mSDsluCounter, 1132 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 1702 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:01,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 1702 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:46:01,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13191 states. [2025-01-09 14:46:01,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13191 to 13189. [2025-01-09 14:46:01,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13189 states, 12340 states have (on average 1.616288492706645) internal successors, (19945), 12354 states have internal predecessors, (19945), 830 states have call successors, (830), 18 states have call predecessors, (830), 18 states have return successors, (830), 816 states have call predecessors, (830), 830 states have call successors, (830) [2025-01-09 14:46:01,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13189 states to 13189 states and 21605 transitions. [2025-01-09 14:46:01,891 INFO L78 Accepts]: Start accepts. Automaton has 13189 states and 21605 transitions. Word has length 607 [2025-01-09 14:46:01,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:01,893 INFO L471 AbstractCegarLoop]: Abstraction has 13189 states and 21605 transitions. [2025-01-09 14:46:01,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 14:46:01,894 INFO L276 IsEmpty]: Start isEmpty. Operand 13189 states and 21605 transitions. [2025-01-09 14:46:01,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2025-01-09 14:46:01,910 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:01,910 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:46:01,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:46:01,910 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:01,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:01,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1789680077, now seen corresponding path program 1 times [2025-01-09 14:46:01,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:01,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636848183] [2025-01-09 14:46:01,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:01,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:01,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 607 statements into 1 equivalence classes. [2025-01-09 14:46:02,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 607 of 607 statements. [2025-01-09 14:46:02,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:02,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:03,529 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-01-09 14:46:03,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:03,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636848183] [2025-01-09 14:46:03,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636848183] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:03,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:03,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:46:03,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111204879] [2025-01-09 14:46:03,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:03,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:46:03,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:03,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:46:03,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:46:03,532 INFO L87 Difference]: Start difference. First operand 13189 states and 21605 transitions. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 14:46:04,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:04,895 INFO L93 Difference]: Finished difference Result 39347 states and 64094 transitions. [2025-01-09 14:46:04,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:46:04,896 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 607 [2025-01-09 14:46:04,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:05,041 INFO L225 Difference]: With dead ends: 39347 [2025-01-09 14:46:05,041 INFO L226 Difference]: Without dead ends: 28237 [2025-01-09 14:46:05,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:46:05,065 INFO L435 NwaCegarLoop]: 1055 mSDtfsCounter, 808 mSDsluCounter, 1708 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 2763 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:05,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 2763 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:46:05,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28237 states. [2025-01-09 14:46:06,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28237 to 23799. [2025-01-09 14:46:06,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23799 states, 22624 states have (on average 1.6282266619519095) internal successors, (36837), 22646 states have internal predecessors, (36837), 1146 states have call successors, (1146), 28 states have call predecessors, (1146), 28 states have return successors, (1146), 1124 states have call predecessors, (1146), 1146 states have call successors, (1146) [2025-01-09 14:46:06,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23799 states to 23799 states and 39129 transitions. [2025-01-09 14:46:06,151 INFO L78 Accepts]: Start accepts. Automaton has 23799 states and 39129 transitions. Word has length 607 [2025-01-09 14:46:06,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:06,154 INFO L471 AbstractCegarLoop]: Abstraction has 23799 states and 39129 transitions. [2025-01-09 14:46:06,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 14:46:06,155 INFO L276 IsEmpty]: Start isEmpty. Operand 23799 states and 39129 transitions. [2025-01-09 14:46:06,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2025-01-09 14:46:06,179 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:06,179 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:46:06,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:46:06,180 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:06,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:06,180 INFO L85 PathProgramCache]: Analyzing trace with hash 103500239, now seen corresponding path program 1 times [2025-01-09 14:46:06,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:06,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992789025] [2025-01-09 14:46:06,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:06,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:06,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 607 statements into 1 equivalence classes. [2025-01-09 14:46:06,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 607 of 607 statements. [2025-01-09 14:46:06,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:06,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:07,312 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-01-09 14:46:07,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:07,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992789025] [2025-01-09 14:46:07,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992789025] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:07,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:07,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:46:07,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603020549] [2025-01-09 14:46:07,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:07,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:46:07,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:07,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:46:07,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:46:07,315 INFO L87 Difference]: Start difference. First operand 23799 states and 39129 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 14:46:07,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:07,936 INFO L93 Difference]: Finished difference Result 48993 states and 80815 transitions. [2025-01-09 14:46:07,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:46:07,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 607 [2025-01-09 14:46:07,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:08,029 INFO L225 Difference]: With dead ends: 48993 [2025-01-09 14:46:08,030 INFO L226 Difference]: Without dead ends: 29729 [2025-01-09 14:46:08,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:46:08,078 INFO L435 NwaCegarLoop]: 659 mSDtfsCounter, 482 mSDsluCounter, 1132 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 1791 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:08,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 1791 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:46:08,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29729 states. [2025-01-09 14:46:08,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29729 to 23799. [2025-01-09 14:46:08,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23799 states, 22624 states have (on average 1.6229225601131543) internal successors, (36717), 22646 states have internal predecessors, (36717), 1146 states have call successors, (1146), 28 states have call predecessors, (1146), 28 states have return successors, (1146), 1124 states have call predecessors, (1146), 1146 states have call successors, (1146) [2025-01-09 14:46:09,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23799 states to 23799 states and 39009 transitions. [2025-01-09 14:46:09,065 INFO L78 Accepts]: Start accepts. Automaton has 23799 states and 39009 transitions. Word has length 607 [2025-01-09 14:46:09,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:09,066 INFO L471 AbstractCegarLoop]: Abstraction has 23799 states and 39009 transitions. [2025-01-09 14:46:09,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 14:46:09,066 INFO L276 IsEmpty]: Start isEmpty. Operand 23799 states and 39009 transitions. [2025-01-09 14:46:09,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2025-01-09 14:46:09,085 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:09,085 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:46:09,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:46:09,086 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:09,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:09,086 INFO L85 PathProgramCache]: Analyzing trace with hash 87981521, now seen corresponding path program 1 times [2025-01-09 14:46:09,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:09,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706690235] [2025-01-09 14:46:09,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:09,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:09,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 607 statements into 1 equivalence classes. [2025-01-09 14:46:10,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 607 of 607 statements. [2025-01-09 14:46:10,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:10,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:10,796 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 114 proven. 159 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-01-09 14:46:10,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:10,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706690235] [2025-01-09 14:46:10,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706690235] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:46:10,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168996571] [2025-01-09 14:46:10,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:10,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:46:10,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:46:10,800 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:46:10,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 14:46:11,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 607 statements into 1 equivalence classes. [2025-01-09 14:46:11,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 607 of 607 statements. [2025-01-09 14:46:11,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:11,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:11,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 1440 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 14:46:11,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:46:13,158 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 8331 proven. 153 refuted. 0 times theorem prover too weak. 8260 trivial. 0 not checked. [2025-01-09 14:46:13,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:46:14,326 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 120 proven. 153 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-01-09 14:46:14,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168996571] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:46:14,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:46:14,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 7] total 16 [2025-01-09 14:46:14,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674829091] [2025-01-09 14:46:14,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:46:14,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 14:46:14,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:14,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 14:46:14,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-01-09 14:46:14,332 INFO L87 Difference]: Start difference. First operand 23799 states and 39009 transitions. Second operand has 16 states, 16 states have (on average 20.4375) internal successors, (327), 16 states have internal predecessors, (327), 5 states have call successors, (237), 3 states have call predecessors, (237), 6 states have return successors, (238), 5 states have call predecessors, (238), 5 states have call successors, (238) [2025-01-09 14:46:18,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:18,677 INFO L93 Difference]: Finished difference Result 49831 states and 80607 transitions. [2025-01-09 14:46:18,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-01-09 14:46:18,678 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 20.4375) internal successors, (327), 16 states have internal predecessors, (327), 5 states have call successors, (237), 3 states have call predecessors, (237), 6 states have return successors, (238), 5 states have call predecessors, (238), 5 states have call successors, (238) Word has length 607 [2025-01-09 14:46:18,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:18,768 INFO L225 Difference]: With dead ends: 49831 [2025-01-09 14:46:18,769 INFO L226 Difference]: Without dead ends: 26221 [2025-01-09 14:46:18,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1270 GetRequests, 1206 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1387 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=867, Invalid=3293, Unknown=0, NotChecked=0, Total=4160 [2025-01-09 14:46:18,813 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 4727 mSDsluCounter, 3511 mSDsCounter, 0 mSdLazyCounter, 1716 mSolverCounterSat, 1890 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4729 SdHoareTripleChecker+Valid, 3961 SdHoareTripleChecker+Invalid, 3606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1890 IncrementalHoareTripleChecker+Valid, 1716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:18,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4729 Valid, 3961 Invalid, 3606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1890 Valid, 1716 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-09 14:46:18,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26221 states. [2025-01-09 14:46:19,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26221 to 13183. [2025-01-09 14:46:19,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13183 states, 12474 states have (on average 1.6113516113516113) internal successors, (20100), 12484 states have internal predecessors, (20100), 678 states have call successors, (678), 30 states have call predecessors, (678), 30 states have return successors, (678), 668 states have call predecessors, (678), 678 states have call successors, (678) [2025-01-09 14:46:19,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13183 states to 13183 states and 21456 transitions. [2025-01-09 14:46:19,536 INFO L78 Accepts]: Start accepts. Automaton has 13183 states and 21456 transitions. Word has length 607 [2025-01-09 14:46:19,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:19,537 INFO L471 AbstractCegarLoop]: Abstraction has 13183 states and 21456 transitions. [2025-01-09 14:46:19,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 20.4375) internal successors, (327), 16 states have internal predecessors, (327), 5 states have call successors, (237), 3 states have call predecessors, (237), 6 states have return successors, (238), 5 states have call predecessors, (238), 5 states have call successors, (238) [2025-01-09 14:46:19,537 INFO L276 IsEmpty]: Start isEmpty. Operand 13183 states and 21456 transitions. [2025-01-09 14:46:19,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-01-09 14:46:19,550 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:19,550 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:46:19,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 14:46:19,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:46:19,751 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:19,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:19,752 INFO L85 PathProgramCache]: Analyzing trace with hash -636698884, now seen corresponding path program 1 times [2025-01-09 14:46:19,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:19,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823646300] [2025-01-09 14:46:19,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:19,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:19,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-01-09 14:46:20,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-01-09 14:46:20,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:20,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:21,256 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-01-09 14:46:21,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:21,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823646300] [2025-01-09 14:46:21,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823646300] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:21,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:21,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:46:21,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732292817] [2025-01-09 14:46:21,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:21,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:46:21,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:21,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:46:21,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:46:21,259 INFO L87 Difference]: Start difference. First operand 13183 states and 21456 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 14:46:22,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:22,334 INFO L93 Difference]: Finished difference Result 33799 states and 54131 transitions. [2025-01-09 14:46:22,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:46:22,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 608 [2025-01-09 14:46:22,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:22,414 INFO L225 Difference]: With dead ends: 33799 [2025-01-09 14:46:22,414 INFO L226 Difference]: Without dead ends: 23447 [2025-01-09 14:46:22,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:46:22,438 INFO L435 NwaCegarLoop]: 664 mSDtfsCounter, 1017 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1017 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:22,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1017 Valid, 1472 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:46:22,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23447 states. [2025-01-09 14:46:23,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23447 to 13861. [2025-01-09 14:46:23,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13861 states, 13152 states have (on average 1.6104014598540146) internal successors, (21180), 13162 states have internal predecessors, (21180), 678 states have call successors, (678), 30 states have call predecessors, (678), 30 states have return successors, (678), 668 states have call predecessors, (678), 678 states have call successors, (678) [2025-01-09 14:46:23,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13861 states to 13861 states and 22536 transitions. [2025-01-09 14:46:23,090 INFO L78 Accepts]: Start accepts. Automaton has 13861 states and 22536 transitions. Word has length 608 [2025-01-09 14:46:23,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:23,091 INFO L471 AbstractCegarLoop]: Abstraction has 13861 states and 22536 transitions. [2025-01-09 14:46:23,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 14:46:23,091 INFO L276 IsEmpty]: Start isEmpty. Operand 13861 states and 22536 transitions. [2025-01-09 14:46:23,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-01-09 14:46:23,103 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:23,103 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:46:23,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 14:46:23,104 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:23,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:23,105 INFO L85 PathProgramCache]: Analyzing trace with hash 64900990, now seen corresponding path program 1 times [2025-01-09 14:46:23,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:23,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214021448] [2025-01-09 14:46:23,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:23,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:23,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-01-09 14:46:23,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-01-09 14:46:23,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:23,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:24,017 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-01-09 14:46:24,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:24,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214021448] [2025-01-09 14:46:24,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214021448] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:24,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:24,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:46:24,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562388292] [2025-01-09 14:46:24,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:24,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:46:24,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:24,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:46:24,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:46:24,020 INFO L87 Difference]: Start difference. First operand 13861 states and 22536 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 14:46:24,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:24,783 INFO L93 Difference]: Finished difference Result 37059 states and 60039 transitions. [2025-01-09 14:46:24,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:46:24,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 608 [2025-01-09 14:46:24,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:24,851 INFO L225 Difference]: With dead ends: 37059 [2025-01-09 14:46:24,852 INFO L226 Difference]: Without dead ends: 25601 [2025-01-09 14:46:24,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:46:24,878 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 1273 mSDsluCounter, 1118 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1273 SdHoareTripleChecker+Valid, 1975 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:24,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1273 Valid, 1975 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:46:24,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25601 states. [2025-01-09 14:46:25,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25601 to 12225. [2025-01-09 14:46:25,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12225 states, 11738 states have (on average 1.6180780371443175) internal successors, (18993), 11742 states have internal predecessors, (18993), 456 states have call successors, (456), 30 states have call predecessors, (456), 30 states have return successors, (456), 452 states have call predecessors, (456), 456 states have call successors, (456) [2025-01-09 14:46:25,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12225 states to 12225 states and 19905 transitions. [2025-01-09 14:46:25,347 INFO L78 Accepts]: Start accepts. Automaton has 12225 states and 19905 transitions. Word has length 608 [2025-01-09 14:46:25,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:25,349 INFO L471 AbstractCegarLoop]: Abstraction has 12225 states and 19905 transitions. [2025-01-09 14:46:25,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 14:46:25,349 INFO L276 IsEmpty]: Start isEmpty. Operand 12225 states and 19905 transitions. [2025-01-09 14:46:25,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-01-09 14:46:25,362 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:25,362 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:46:25,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 14:46:25,363 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:25,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:25,363 INFO L85 PathProgramCache]: Analyzing trace with hash -667066436, now seen corresponding path program 1 times [2025-01-09 14:46:25,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:25,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914734426] [2025-01-09 14:46:25,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:25,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:25,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-01-09 14:46:26,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-01-09 14:46:26,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:26,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:26,706 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 123 proven. 150 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-01-09 14:46:26,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:26,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914734426] [2025-01-09 14:46:26,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914734426] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:46:26,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520474512] [2025-01-09 14:46:26,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:26,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:46:26,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:46:26,710 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:46:26,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 14:46:26,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-01-09 14:46:27,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-01-09 14:46:27,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:27,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:27,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 1439 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:46:27,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:46:27,533 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 6111 proven. 63 refuted. 0 times theorem prover too weak. 10570 trivial. 0 not checked. [2025-01-09 14:46:27,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:46:28,000 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 210 proven. 63 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-01-09 14:46:28,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520474512] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:46:28,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:46:28,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-01-09 14:46:28,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714773549] [2025-01-09 14:46:28,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:46:28,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:46:28,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:28,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:46:28,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:46:28,005 INFO L87 Difference]: Start difference. First operand 12225 states and 19905 transitions. Second operand has 9 states, 9 states have (on average 24.333333333333332) internal successors, (219), 9 states have internal predecessors, (219), 4 states have call successors, (163), 2 states have call predecessors, (163), 4 states have return successors, (165), 4 states have call predecessors, (165), 4 states have call successors, (165) [2025-01-09 14:46:29,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:29,157 INFO L93 Difference]: Finished difference Result 20030 states and 32338 transitions. [2025-01-09 14:46:29,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 14:46:29,158 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 24.333333333333332) internal successors, (219), 9 states have internal predecessors, (219), 4 states have call successors, (163), 2 states have call predecessors, (163), 4 states have return successors, (165), 4 states have call predecessors, (165), 4 states have call successors, (165) Word has length 608 [2025-01-09 14:46:29,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:29,183 INFO L225 Difference]: With dead ends: 20030 [2025-01-09 14:46:29,184 INFO L226 Difference]: Without dead ends: 8232 [2025-01-09 14:46:29,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1228 GetRequests, 1213 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:46:29,200 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 1456 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 571 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1457 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 1084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 571 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:29,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1457 Valid, 1190 Invalid, 1084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [571 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 14:46:29,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8232 states. [2025-01-09 14:46:29,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8232 to 8184. [2025-01-09 14:46:29,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8184 states, 7687 states have (on average 1.5802003382333811) internal successors, (12147), 7691 states have internal predecessors, (12147), 456 states have call successors, (456), 40 states have call predecessors, (456), 40 states have return successors, (456), 452 states have call predecessors, (456), 456 states have call successors, (456) [2025-01-09 14:46:29,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8184 states to 8184 states and 13059 transitions. [2025-01-09 14:46:29,517 INFO L78 Accepts]: Start accepts. Automaton has 8184 states and 13059 transitions. Word has length 608 [2025-01-09 14:46:29,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:29,518 INFO L471 AbstractCegarLoop]: Abstraction has 8184 states and 13059 transitions. [2025-01-09 14:46:29,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 24.333333333333332) internal successors, (219), 9 states have internal predecessors, (219), 4 states have call successors, (163), 2 states have call predecessors, (163), 4 states have return successors, (165), 4 states have call predecessors, (165), 4 states have call successors, (165) [2025-01-09 14:46:29,519 INFO L276 IsEmpty]: Start isEmpty. Operand 8184 states and 13059 transitions. [2025-01-09 14:46:29,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2025-01-09 14:46:29,527 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:29,528 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:46:29,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 14:46:29,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 14:46:29,732 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:29,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:29,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1482143187, now seen corresponding path program 1 times [2025-01-09 14:46:29,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:29,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74270278] [2025-01-09 14:46:29,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:29,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:29,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 609 statements into 1 equivalence classes. [2025-01-09 14:46:30,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 609 of 609 statements. [2025-01-09 14:46:30,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:30,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:30,595 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-01-09 14:46:30,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:30,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74270278] [2025-01-09 14:46:30,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74270278] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:30,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:30,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:46:30,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248473540] [2025-01-09 14:46:30,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:30,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:46:30,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:30,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:46:30,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:46:30,598 INFO L87 Difference]: Start difference. First operand 8184 states and 13059 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 14:46:31,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:31,032 INFO L93 Difference]: Finished difference Result 15110 states and 23945 transitions. [2025-01-09 14:46:31,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:46:31,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 609 [2025-01-09 14:46:31,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:31,056 INFO L225 Difference]: With dead ends: 15110 [2025-01-09 14:46:31,057 INFO L226 Difference]: Without dead ends: 8628 [2025-01-09 14:46:31,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:46:31,069 INFO L435 NwaCegarLoop]: 706 mSDtfsCounter, 413 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 1866 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:31,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 1866 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:46:31,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8628 states. [2025-01-09 14:46:31,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8628 to 7412. [2025-01-09 14:46:31,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7412 states, 6915 states have (on average 1.5694866232827187) internal successors, (10853), 6919 states have internal predecessors, (10853), 456 states have call successors, (456), 40 states have call predecessors, (456), 40 states have return successors, (456), 452 states have call predecessors, (456), 456 states have call successors, (456) [2025-01-09 14:46:31,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7412 states to 7412 states and 11765 transitions. [2025-01-09 14:46:31,439 INFO L78 Accepts]: Start accepts. Automaton has 7412 states and 11765 transitions. Word has length 609 [2025-01-09 14:46:31,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:31,440 INFO L471 AbstractCegarLoop]: Abstraction has 7412 states and 11765 transitions. [2025-01-09 14:46:31,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-01-09 14:46:31,441 INFO L276 IsEmpty]: Start isEmpty. Operand 7412 states and 11765 transitions. [2025-01-09 14:46:31,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 611 [2025-01-09 14:46:31,448 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:31,448 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:46:31,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 14:46:31,448 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:31,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:31,449 INFO L85 PathProgramCache]: Analyzing trace with hash 457442011, now seen corresponding path program 1 times [2025-01-09 14:46:31,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:31,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496390753] [2025-01-09 14:46:31,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:31,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:31,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 610 statements into 1 equivalence classes. [2025-01-09 14:46:32,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 610 of 610 statements. [2025-01-09 14:46:32,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:32,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:33,063 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 186 proven. 87 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-01-09 14:46:33,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:33,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496390753] [2025-01-09 14:46:33,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496390753] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:46:33,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877484617] [2025-01-09 14:46:33,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:33,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:46:33,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:46:33,066 INFO L229 MonitoredProcess]: Starting monitored process 6 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:46:33,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 14:46:33,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 610 statements into 1 equivalence classes. [2025-01-09 14:46:33,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 610 of 610 statements. [2025-01-09 14:46:33,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:33,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:33,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 1439 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 14:46:33,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:46:35,090 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 8867 proven. 192 refuted. 0 times theorem prover too weak. 7685 trivial. 0 not checked. [2025-01-09 14:46:35,090 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:46:36,188 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 186 proven. 87 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-01-09 14:46:36,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877484617] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:46:36,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:46:36,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 11] total 27 [2025-01-09 14:46:36,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165415151] [2025-01-09 14:46:36,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:46:36,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 14:46:36,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:36,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 14:46:36,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=567, Unknown=0, NotChecked=0, Total=702 [2025-01-09 14:46:36,193 INFO L87 Difference]: Start difference. First operand 7412 states and 11765 transitions. Second operand has 27 states, 27 states have (on average 14.185185185185185) internal successors, (383), 27 states have internal predecessors, (383), 6 states have call successors, (213), 4 states have call predecessors, (213), 8 states have return successors, (214), 6 states have call predecessors, (214), 6 states have call successors, (214) [2025-01-09 14:46:40,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:40,544 INFO L93 Difference]: Finished difference Result 20252 states and 32147 transitions. [2025-01-09 14:46:40,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-01-09 14:46:40,544 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 14.185185185185185) internal successors, (383), 27 states have internal predecessors, (383), 6 states have call successors, (213), 4 states have call predecessors, (213), 8 states have return successors, (214), 6 states have call predecessors, (214), 6 states have call successors, (214) Word has length 610 [2025-01-09 14:46:40,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:40,570 INFO L225 Difference]: With dead ends: 20252 [2025-01-09 14:46:40,571 INFO L226 Difference]: Without dead ends: 13026 [2025-01-09 14:46:40,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1268 GetRequests, 1203 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1099 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1030, Invalid=3392, Unknown=0, NotChecked=0, Total=4422 [2025-01-09 14:46:40,583 INFO L435 NwaCegarLoop]: 707 mSDtfsCounter, 6530 mSDsluCounter, 4434 mSDsCounter, 0 mSdLazyCounter, 3335 mSolverCounterSat, 2539 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6594 SdHoareTripleChecker+Valid, 5141 SdHoareTripleChecker+Invalid, 5874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2539 IncrementalHoareTripleChecker+Valid, 3335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:40,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6594 Valid, 5141 Invalid, 5874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2539 Valid, 3335 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-09 14:46:40,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13026 states.