./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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-5.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 eb1314039a089ae50ffa2cf06a09d28c366b7983113714c5c1bfc7b71c13fc9d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:41:08,598 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:41:08,641 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:41:08,644 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:41:08,644 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:41:08,665 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:41:08,665 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:41:08,666 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:41:08,666 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:41:08,666 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:41:08,667 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:41:08,667 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:41:08,667 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:41:08,667 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:41:08,668 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:41:08,668 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:41:08,668 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:41:08,668 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:41:08,668 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:41:08,668 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:41:08,669 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:41:08,669 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:41:08,669 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:41:08,669 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:41:08,669 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:41:08,669 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:41:08,669 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:41:08,669 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:41:08,669 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:41:08,669 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:41:08,670 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:41:08,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:41:08,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:41:08,670 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:41:08,670 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:41:08,670 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:41:08,670 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:41:08,670 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:41:08,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:41:08,670 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:41:08,670 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:41:08,670 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:41:08,670 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:41:08,670 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 -> eb1314039a089ae50ffa2cf06a09d28c366b7983113714c5c1bfc7b71c13fc9d [2025-02-06 02:41:08,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:41:08,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:41:08,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:41:08,915 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:41:08,916 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:41:08,916 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-5.i [2025-02-06 02:41:10,052 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/70fa820dc/fa8aabe7885e4af58dcf2dc72b2882b7/FLAGfbb9cdfad [2025-02-06 02:41:10,480 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:41:10,481 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-5.i [2025-02-06 02:41:10,522 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/70fa820dc/fa8aabe7885e4af58dcf2dc72b2882b7/FLAGfbb9cdfad [2025-02-06 02:41:10,650 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/70fa820dc/fa8aabe7885e4af58dcf2dc72b2882b7 [2025-02-06 02:41:10,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:41:10,654 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:41:10,659 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:41:10,659 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:41:10,663 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:41:10,665 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:41:10" (1/1) ... [2025-02-06 02:41:10,666 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f4dce94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:10, skipping insertion in model container [2025-02-06 02:41:10,667 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:41:10" (1/1) ... [2025-02-06 02:41:10,724 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:41:10,833 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-5.i[915,928] [2025-02-06 02:41:10,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:41:10,996 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:41:11,003 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-5.i[915,928] [2025-02-06 02:41:11,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:41:11,121 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:41:11,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:11 WrapperNode [2025-02-06 02:41:11,122 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:41:11,123 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:41:11,124 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:41:11,124 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:41:11,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:11" (1/1) ... [2025-02-06 02:41:11,144 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:11" (1/1) ... [2025-02-06 02:41:11,201 INFO L138 Inliner]: procedures = 26, calls = 102, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 877 [2025-02-06 02:41:11,202 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:41:11,203 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:41:11,203 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:41:11,203 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:41:11,209 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:11" (1/1) ... [2025-02-06 02:41:11,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:11" (1/1) ... [2025-02-06 02:41:11,219 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:11" (1/1) ... [2025-02-06 02:41:11,265 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-02-06 02:41:11,265 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:11" (1/1) ... [2025-02-06 02:41:11,265 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:11" (1/1) ... [2025-02-06 02:41:11,286 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:11" (1/1) ... [2025-02-06 02:41:11,287 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:11" (1/1) ... [2025-02-06 02:41:11,291 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:11" (1/1) ... [2025-02-06 02:41:11,293 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:11" (1/1) ... [2025-02-06 02:41:11,302 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:41:11,302 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:41:11,302 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:41:11,302 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:41:11,303 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:11" (1/1) ... [2025-02-06 02:41:11,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:41:11,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:41:11,325 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-02-06 02:41:11,332 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-02-06 02:41:11,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:41:11,348 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:41:11,348 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:41:11,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:41:11,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:41:11,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:41:11,456 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:41:11,457 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:41:12,320 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L680: havoc property_#t~ite70#1;havoc property_#t~ite69#1;havoc property_#t~ite68#1;havoc property_#t~ite67#1;havoc property_#t~ite66#1;havoc property_#t~bitwise65#1;havoc property_#t~short71#1;havoc property_#t~bitwise72#1;havoc property_#t~short73#1;havoc property_#t~bitwise74#1;havoc property_#t~short75#1;havoc property_#t~ite77#1;havoc property_#t~bitwise76#1;havoc property_#t~short78#1;havoc property_#t~ite80#1;havoc property_#t~bitwise79#1;havoc property_#t~short81#1;havoc property_#t~bitwise82#1;havoc property_#t~ite86#1;havoc property_#t~bitwise83#1;havoc property_#t~ite85#1;havoc property_#t~bitwise84#1;havoc property_#t~short87#1;havoc property_#t~bitwise88#1;havoc property_#t~short89#1; [2025-02-06 02:41:12,459 INFO L? ?]: Removed 119 outVars from TransFormulas that were not future-live. [2025-02-06 02:41:12,460 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:41:12,492 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:41:12,492 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-06 02:41:12,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:41:12 BoogieIcfgContainer [2025-02-06 02:41:12,493 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:41:12,495 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:41:12,495 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:41:12,497 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:41:12,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:41:10" (1/3) ... [2025-02-06 02:41:12,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e71a1ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:41:12, skipping insertion in model container [2025-02-06 02:41:12,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:41:11" (2/3) ... [2025-02-06 02:41:12,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e71a1ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:41:12, skipping insertion in model container [2025-02-06 02:41:12,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:41:12" (3/3) ... [2025-02-06 02:41:12,500 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-5.i [2025-02-06 02:41:12,510 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:41:12,513 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-5.i that has 2 procedures, 356 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:41:12,567 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:41:12,577 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;@25f93795, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:41:12,577 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:41:12,581 INFO L276 IsEmpty]: Start isEmpty. Operand has 356 states, 264 states have (on average 1.518939393939394) internal successors, (401), 265 states have internal predecessors, (401), 89 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) [2025-02-06 02:41:12,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2025-02-06 02:41:12,606 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:12,606 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:41:12,607 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:12,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:12,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1355922740, now seen corresponding path program 1 times [2025-02-06 02:41:12,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:12,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549071572] [2025-02-06 02:41:12,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:12,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:12,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 592 statements into 1 equivalence classes. [2025-02-06 02:41:12,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 592 of 592 statements. [2025-02-06 02:41:12,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:12,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:13,163 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 15488 trivial. 0 not checked. [2025-02-06 02:41:13,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:13,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549071572] [2025-02-06 02:41:13,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549071572] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:41:13,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600239353] [2025-02-06 02:41:13,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:13,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:41:13,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:41:13,168 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-02-06 02:41:13,178 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-02-06 02:41:13,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 592 statements into 1 equivalence classes. [2025-02-06 02:41:13,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 592 of 592 statements. [2025-02-06 02:41:13,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:13,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:13,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 1381 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:41:13,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:41:13,633 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 15488 trivial. 0 not checked. [2025-02-06 02:41:13,634 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:41:13,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600239353] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:13,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:41:13,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:41:13,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923998891] [2025-02-06 02:41:13,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:13,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:41:13,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:13,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:41:13,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:41:13,662 INFO L87 Difference]: Start difference. First operand has 356 states, 264 states have (on average 1.518939393939394) internal successors, (401), 265 states have internal predecessors, (401), 89 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) Second operand has 2 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 2 states have call successors, (89), 2 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 2 states have call successors, (89) [2025-02-06 02:41:13,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:13,755 INFO L93 Difference]: Finished difference Result 706 states and 1242 transitions. [2025-02-06 02:41:13,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:41:13,757 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 2 states have call successors, (89), 2 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 2 states have call successors, (89) Word has length 592 [2025-02-06 02:41:13,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:13,766 INFO L225 Difference]: With dead ends: 706 [2025-02-06 02:41:13,767 INFO L226 Difference]: Without dead ends: 353 [2025-02-06 02:41:13,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 593 GetRequests, 593 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-02-06 02:41:13,775 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:13,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 554 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:41:13,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-02-06 02:41:13,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2025-02-06 02:41:13,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 262 states have (on average 1.5038167938931297) internal successors, (394), 262 states have internal predecessors, (394), 89 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) [2025-02-06 02:41:13,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 572 transitions. [2025-02-06 02:41:13,839 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 572 transitions. Word has length 592 [2025-02-06 02:41:13,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:13,839 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 572 transitions. [2025-02-06 02:41:13,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 2 states have call successors, (89), 2 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 2 states have call successors, (89) [2025-02-06 02:41:13,840 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 572 transitions. [2025-02-06 02:41:13,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2025-02-06 02:41:13,847 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:13,848 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:41:13,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 02:41:14,052 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-02-06 02:41:14,053 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:14,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:14,053 INFO L85 PathProgramCache]: Analyzing trace with hash 889908092, now seen corresponding path program 1 times [2025-02-06 02:41:14,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:14,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080561355] [2025-02-06 02:41:14,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:14,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:14,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-02-06 02:41:14,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-02-06 02:41:14,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:14,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:14,741 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-02-06 02:41:14,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:14,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080561355] [2025-02-06 02:41:14,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080561355] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:14,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:14,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:41:14,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933245397] [2025-02-06 02:41:14,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:14,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:41:14,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:14,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:41:14,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:14,747 INFO L87 Difference]: Start difference. First operand 353 states and 572 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-02-06 02:41:14,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:14,915 INFO L93 Difference]: Finished difference Result 1049 states and 1702 transitions. [2025-02-06 02:41:14,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:41:14,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 593 [2025-02-06 02:41:14,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:14,921 INFO L225 Difference]: With dead ends: 1049 [2025-02-06 02:41:14,921 INFO L226 Difference]: Without dead ends: 699 [2025-02-06 02:41:14,922 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-02-06 02:41:14,922 INFO L435 NwaCegarLoop]: 960 mSDtfsCounter, 544 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 1496 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:14,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 1496 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:41:14,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-02-06 02:41:14,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 376. [2025-02-06 02:41:14,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 285 states have (on average 1.5157894736842106) internal successors, (432), 285 states have internal predecessors, (432), 89 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) [2025-02-06 02:41:14,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 610 transitions. [2025-02-06 02:41:14,958 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 610 transitions. Word has length 593 [2025-02-06 02:41:14,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:14,960 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 610 transitions. [2025-02-06 02:41:14,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-02-06 02:41:14,960 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 610 transitions. [2025-02-06 02:41:14,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2025-02-06 02:41:14,967 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:14,967 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:41:14,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:41:14,968 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:14,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:14,969 INFO L85 PathProgramCache]: Analyzing trace with hash 903440893, now seen corresponding path program 1 times [2025-02-06 02:41:14,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:14,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862392380] [2025-02-06 02:41:14,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:14,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:15,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-02-06 02:41:15,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-02-06 02:41:15,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:15,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:15,377 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-02-06 02:41:15,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:15,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862392380] [2025-02-06 02:41:15,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862392380] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:15,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:15,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:41:15,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141306482] [2025-02-06 02:41:15,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:15,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:41:15,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:15,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:41:15,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:15,382 INFO L87 Difference]: Start difference. First operand 376 states and 610 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-02-06 02:41:15,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:15,534 INFO L93 Difference]: Finished difference Result 1102 states and 1791 transitions. [2025-02-06 02:41:15,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:41:15,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 593 [2025-02-06 02:41:15,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:15,546 INFO L225 Difference]: With dead ends: 1102 [2025-02-06 02:41:15,548 INFO L226 Difference]: Without dead ends: 729 [2025-02-06 02:41:15,549 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-02-06 02:41:15,551 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 540 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:15,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 1051 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:41:15,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2025-02-06 02:41:15,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 726. [2025-02-06 02:41:15,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 545 states have (on average 1.5027522935779816) internal successors, (819), 545 states have internal predecessors, (819), 178 states have call successors, (178), 2 states have call predecessors, (178), 2 states have return successors, (178), 178 states have call predecessors, (178), 178 states have call successors, (178) [2025-02-06 02:41:15,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1175 transitions. [2025-02-06 02:41:15,629 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1175 transitions. Word has length 593 [2025-02-06 02:41:15,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:15,630 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 1175 transitions. [2025-02-06 02:41:15,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-02-06 02:41:15,632 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1175 transitions. [2025-02-06 02:41:15,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2025-02-06 02:41:15,637 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:15,638 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:41:15,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:41:15,638 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:15,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:15,639 INFO L85 PathProgramCache]: Analyzing trace with hash -554490036, now seen corresponding path program 1 times [2025-02-06 02:41:15,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:15,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252434766] [2025-02-06 02:41:15,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:15,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:15,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-02-06 02:41:15,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-02-06 02:41:15,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:15,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:15,989 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-02-06 02:41:15,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:15,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252434766] [2025-02-06 02:41:15,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252434766] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:15,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:15,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:41:15,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009412455] [2025-02-06 02:41:15,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:15,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:41:15,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:15,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:41:15,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:15,992 INFO L87 Difference]: Start difference. First operand 726 states and 1175 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-02-06 02:41:16,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:16,128 INFO L93 Difference]: Finished difference Result 2072 states and 3349 transitions. [2025-02-06 02:41:16,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:41:16,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 593 [2025-02-06 02:41:16,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:16,138 INFO L225 Difference]: With dead ends: 2072 [2025-02-06 02:41:16,138 INFO L226 Difference]: Without dead ends: 1349 [2025-02-06 02:41:16,142 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-02-06 02:41:16,143 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 503 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:16,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 1121 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:41:16,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2025-02-06 02:41:16,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 874. [2025-02-06 02:41:16,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 693 states have (on average 1.5425685425685425) internal successors, (1069), 693 states have internal predecessors, (1069), 178 states have call successors, (178), 2 states have call predecessors, (178), 2 states have return successors, (178), 178 states have call predecessors, (178), 178 states have call successors, (178) [2025-02-06 02:41:16,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1425 transitions. [2025-02-06 02:41:16,219 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1425 transitions. Word has length 593 [2025-02-06 02:41:16,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:16,219 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1425 transitions. [2025-02-06 02:41:16,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-02-06 02:41:16,220 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1425 transitions. [2025-02-06 02:41:16,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2025-02-06 02:41:16,226 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:16,226 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:41:16,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:41:16,226 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:16,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:16,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1398961907, now seen corresponding path program 1 times [2025-02-06 02:41:16,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:16,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270390901] [2025-02-06 02:41:16,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:16,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:16,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-02-06 02:41:16,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-02-06 02:41:16,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:16,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:17,346 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-02-06 02:41:17,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:17,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270390901] [2025-02-06 02:41:17,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270390901] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:17,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:17,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:41:17,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463652762] [2025-02-06 02:41:17,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:17,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:41:17,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:17,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:41:17,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:41:17,349 INFO L87 Difference]: Start difference. First operand 874 states and 1425 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, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-02-06 02:41:17,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:17,952 INFO L93 Difference]: Finished difference Result 2769 states and 4538 transitions. [2025-02-06 02:41:17,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:41:17,953 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, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 593 [2025-02-06 02:41:17,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:17,961 INFO L225 Difference]: With dead ends: 2769 [2025-02-06 02:41:17,961 INFO L226 Difference]: Without dead ends: 1898 [2025-02-06 02:41:17,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:41:17,964 INFO L435 NwaCegarLoop]: 761 mSDtfsCounter, 663 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 2385 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:17,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 2385 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:41:17,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2025-02-06 02:41:18,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1022. [2025-02-06 02:41:18,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 751 states have (on average 1.5019973368841544) internal successors, (1128), 751 states have internal predecessors, (1128), 267 states have call successors, (267), 3 states have call predecessors, (267), 3 states have return successors, (267), 267 states have call predecessors, (267), 267 states have call successors, (267) [2025-02-06 02:41:18,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1662 transitions. [2025-02-06 02:41:18,050 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1662 transitions. Word has length 593 [2025-02-06 02:41:18,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:18,051 INFO L471 AbstractCegarLoop]: Abstraction has 1022 states and 1662 transitions. [2025-02-06 02:41:18,051 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, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-02-06 02:41:18,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1662 transitions. [2025-02-06 02:41:18,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2025-02-06 02:41:18,055 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:18,055 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:41:18,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:41:18,055 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:18,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:18,056 INFO L85 PathProgramCache]: Analyzing trace with hash -492189684, now seen corresponding path program 1 times [2025-02-06 02:41:18,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:18,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258696926] [2025-02-06 02:41:18,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:18,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:18,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-02-06 02:41:18,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-02-06 02:41:18,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:18,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:19,561 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-02-06 02:41:19,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:19,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258696926] [2025-02-06 02:41:19,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258696926] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:19,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:19,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:41:19,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821912850] [2025-02-06 02:41:19,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:19,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:41:19,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:19,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:41:19,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:41:19,564 INFO L87 Difference]: Start difference. First operand 1022 states and 1662 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, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-02-06 02:41:20,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:20,441 INFO L93 Difference]: Finished difference Result 3848 states and 6243 transitions. [2025-02-06 02:41:20,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:41:20,442 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, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 593 [2025-02-06 02:41:20,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:20,458 INFO L225 Difference]: With dead ends: 3848 [2025-02-06 02:41:20,458 INFO L226 Difference]: Without dead ends: 2977 [2025-02-06 02:41:20,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:41:20,461 INFO L435 NwaCegarLoop]: 897 mSDtfsCounter, 1689 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1689 SdHoareTripleChecker+Valid, 2032 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:20,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1689 Valid, 2032 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 02:41:20,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2977 states. [2025-02-06 02:41:20,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2977 to 1743. [2025-02-06 02:41:20,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1743 states, 1365 states have (on average 1.531135531135531) internal successors, (2090), 1367 states have internal predecessors, (2090), 371 states have call successors, (371), 6 states have call predecessors, (371), 6 states have return successors, (371), 369 states have call predecessors, (371), 371 states have call successors, (371) [2025-02-06 02:41:20,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 2832 transitions. [2025-02-06 02:41:20,591 INFO L78 Accepts]: Start accepts. Automaton has 1743 states and 2832 transitions. Word has length 593 [2025-02-06 02:41:20,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:20,592 INFO L471 AbstractCegarLoop]: Abstraction has 1743 states and 2832 transitions. [2025-02-06 02:41:20,592 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, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-02-06 02:41:20,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 2832 transitions. [2025-02-06 02:41:20,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2025-02-06 02:41:20,596 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:20,596 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:41:20,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:41:20,597 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:20,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:20,597 INFO L85 PathProgramCache]: Analyzing trace with hash -72672853, now seen corresponding path program 1 times [2025-02-06 02:41:20,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:20,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632809659] [2025-02-06 02:41:20,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:20,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:20,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-02-06 02:41:21,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-02-06 02:41:21,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:21,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:22,346 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 39 proven. 225 refuted. 0 times theorem prover too weak. 15400 trivial. 0 not checked. [2025-02-06 02:41:22,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:22,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632809659] [2025-02-06 02:41:22,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632809659] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:41:22,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958205317] [2025-02-06 02:41:22,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:22,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:41:22,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:41:22,349 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-02-06 02:41:22,351 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-02-06 02:41:22,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-02-06 02:41:22,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-02-06 02:41:22,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:22,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:22,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 1383 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 02:41:22,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:41:23,284 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 6864 proven. 180 refuted. 0 times theorem prover too weak. 8620 trivial. 0 not checked. [2025-02-06 02:41:23,286 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:41:23,778 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 84 proven. 180 refuted. 0 times theorem prover too weak. 15400 trivial. 0 not checked. [2025-02-06 02:41:23,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958205317] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:41:23,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:41:23,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-02-06 02:41:23,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65033700] [2025-02-06 02:41:23,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:41:23,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 02:41:23,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:23,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 02:41:23,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-06 02:41:23,782 INFO L87 Difference]: Start difference. First operand 1743 states and 2832 transitions. Second operand has 12 states, 12 states have (on average 26.583333333333332) internal successors, (319), 12 states have internal predecessors, (319), 4 states have call successors, (224), 2 states have call predecessors, (224), 4 states have return successors, (226), 4 states have call predecessors, (226), 4 states have call successors, (226) [2025-02-06 02:41:24,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:24,865 INFO L93 Difference]: Finished difference Result 4175 states and 6710 transitions. [2025-02-06 02:41:24,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 02:41:24,866 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 26.583333333333332) internal successors, (319), 12 states have internal predecessors, (319), 4 states have call successors, (224), 2 states have call predecessors, (224), 4 states have return successors, (226), 4 states have call predecessors, (226), 4 states have call successors, (226) Word has length 593 [2025-02-06 02:41:24,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:24,879 INFO L225 Difference]: With dead ends: 4175 [2025-02-06 02:41:24,879 INFO L226 Difference]: Without dead ends: 2587 [2025-02-06 02:41:24,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1206 GetRequests, 1184 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2025-02-06 02:41:24,883 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 1793 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1807 SdHoareTripleChecker+Valid, 1927 SdHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:24,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1807 Valid, 1927 Invalid, 1391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 02:41:24,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2587 states. [2025-02-06 02:41:24,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2587 to 2569. [2025-02-06 02:41:24,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2569 states, 2125 states have (on average 1.512470588235294) internal successors, (3214), 2131 states have internal predecessors, (3214), 423 states have call successors, (423), 20 states have call predecessors, (423), 20 states have return successors, (423), 417 states have call predecessors, (423), 423 states have call successors, (423) [2025-02-06 02:41:25,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 4060 transitions. [2025-02-06 02:41:25,003 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 4060 transitions. Word has length 593 [2025-02-06 02:41:25,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:25,006 INFO L471 AbstractCegarLoop]: Abstraction has 2569 states and 4060 transitions. [2025-02-06 02:41:25,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 26.583333333333332) internal successors, (319), 12 states have internal predecessors, (319), 4 states have call successors, (224), 2 states have call predecessors, (224), 4 states have return successors, (226), 4 states have call predecessors, (226), 4 states have call successors, (226) [2025-02-06 02:41:25,006 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 4060 transitions. [2025-02-06 02:41:25,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2025-02-06 02:41:25,011 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:25,012 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:41:25,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 02:41:25,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:41:25,216 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:25,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:25,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1668929099, now seen corresponding path program 1 times [2025-02-06 02:41:25,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:25,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622516088] [2025-02-06 02:41:25,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:25,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:25,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-02-06 02:41:25,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-02-06 02:41:25,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:25,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:26,883 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-02-06 02:41:26,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:26,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622516088] [2025-02-06 02:41:26,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622516088] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:26,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:26,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 02:41:26,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618779444] [2025-02-06 02:41:26,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:26,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 02:41:26,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:26,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 02:41:26,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-02-06 02:41:26,886 INFO L87 Difference]: Start difference. First operand 2569 states and 4060 transitions. Second operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 11 states have internal predecessors, (151), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-02-06 02:41:30,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:30,321 INFO L93 Difference]: Finished difference Result 11344 states and 17826 transitions. [2025-02-06 02:41:30,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 02:41:30,323 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 11 states have internal predecessors, (151), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 593 [2025-02-06 02:41:30,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:30,361 INFO L225 Difference]: With dead ends: 11344 [2025-02-06 02:41:30,362 INFO L226 Difference]: Without dead ends: 8938 [2025-02-06 02:41:30,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-02-06 02:41:30,371 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 3120 mSDsluCounter, 2648 mSDsCounter, 0 mSdLazyCounter, 2168 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3120 SdHoareTripleChecker+Valid, 3521 SdHoareTripleChecker+Invalid, 2634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 2168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:30,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3120 Valid, 3521 Invalid, 2634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 2168 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-06 02:41:30,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8938 states. [2025-02-06 02:41:30,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8938 to 7859. [2025-02-06 02:41:30,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7859 states, 6969 states have (on average 1.5402496771416272) internal successors, (10734), 6991 states have internal predecessors, (10734), 837 states have call successors, (837), 52 states have call predecessors, (837), 52 states have return successors, (837), 815 states have call predecessors, (837), 837 states have call successors, (837) [2025-02-06 02:41:30,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7859 states to 7859 states and 12408 transitions. [2025-02-06 02:41:30,886 INFO L78 Accepts]: Start accepts. Automaton has 7859 states and 12408 transitions. Word has length 593 [2025-02-06 02:41:30,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:30,888 INFO L471 AbstractCegarLoop]: Abstraction has 7859 states and 12408 transitions. [2025-02-06 02:41:30,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 11 states have internal predecessors, (151), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-02-06 02:41:30,889 INFO L276 IsEmpty]: Start isEmpty. Operand 7859 states and 12408 transitions. [2025-02-06 02:41:30,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-02-06 02:41:30,905 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:30,906 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:41:30,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:41:30,906 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:30,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:30,909 INFO L85 PathProgramCache]: Analyzing trace with hash 807330688, now seen corresponding path program 1 times [2025-02-06 02:41:30,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:30,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620719001] [2025-02-06 02:41:30,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:30,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:30,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-02-06 02:41:30,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-02-06 02:41:30,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:30,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:31,357 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-02-06 02:41:31,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:31,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620719001] [2025-02-06 02:41:31,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620719001] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:31,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:31,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:41:31,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426444024] [2025-02-06 02:41:31,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:31,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:41:31,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:31,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:41:31,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:31,360 INFO L87 Difference]: Start difference. First operand 7859 states and 12408 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-02-06 02:41:32,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:32,175 INFO L93 Difference]: Finished difference Result 23251 states and 36726 transitions. [2025-02-06 02:41:32,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:41:32,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 594 [2025-02-06 02:41:32,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:32,236 INFO L225 Difference]: With dead ends: 23251 [2025-02-06 02:41:32,237 INFO L226 Difference]: Without dead ends: 15555 [2025-02-06 02:41:32,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-02-06 02:41:32,251 INFO L435 NwaCegarLoop]: 797 mSDtfsCounter, 527 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:32,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 1336 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:41:32,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15555 states. [2025-02-06 02:41:32,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15555 to 8477. [2025-02-06 02:41:32,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8477 states, 7587 states have (on average 1.5455384209832608) internal successors, (11726), 7609 states have internal predecessors, (11726), 837 states have call successors, (837), 52 states have call predecessors, (837), 52 states have return successors, (837), 815 states have call predecessors, (837), 837 states have call successors, (837) [2025-02-06 02:41:32,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8477 states to 8477 states and 13400 transitions. [2025-02-06 02:41:32,986 INFO L78 Accepts]: Start accepts. Automaton has 8477 states and 13400 transitions. Word has length 594 [2025-02-06 02:41:32,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:32,987 INFO L471 AbstractCegarLoop]: Abstraction has 8477 states and 13400 transitions. [2025-02-06 02:41:32,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-02-06 02:41:32,988 INFO L276 IsEmpty]: Start isEmpty. Operand 8477 states and 13400 transitions. [2025-02-06 02:41:32,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-02-06 02:41:32,999 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:33,000 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:41:33,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:41:33,000 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:33,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:33,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1047870817, now seen corresponding path program 1 times [2025-02-06 02:41:33,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:33,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897557221] [2025-02-06 02:41:33,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:33,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:33,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-02-06 02:41:33,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-02-06 02:41:33,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:33,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:39,091 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-02-06 02:41:39,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:39,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897557221] [2025-02-06 02:41:39,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897557221] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:39,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:39,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-02-06 02:41:39,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168849001] [2025-02-06 02:41:39,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:39,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 02:41:39,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:39,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 02:41:39,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2025-02-06 02:41:39,094 INFO L87 Difference]: Start difference. First operand 8477 states and 13400 transitions. Second operand has 21 states, 21 states have (on average 7.238095238095238) internal successors, (152), 21 states have internal predecessors, (152), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-02-06 02:42:14,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:14,505 INFO L93 Difference]: Finished difference Result 143463 states and 225537 transitions. [2025-02-06 02:42:14,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2025-02-06 02:42:14,506 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 7.238095238095238) internal successors, (152), 21 states have internal predecessors, (152), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) Word has length 594 [2025-02-06 02:42:14,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:14,769 INFO L225 Difference]: With dead ends: 143463 [2025-02-06 02:42:14,769 INFO L226 Difference]: Without dead ends: 135149 [2025-02-06 02:42:14,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2793 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=1692, Invalid=7428, Unknown=0, NotChecked=0, Total=9120 [2025-02-06 02:42:14,810 INFO L435 NwaCegarLoop]: 815 mSDtfsCounter, 30026 mSDsluCounter, 7810 mSDsCounter, 0 mSdLazyCounter, 7003 mSolverCounterSat, 4660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30026 SdHoareTripleChecker+Valid, 8625 SdHoareTripleChecker+Invalid, 11663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4660 IncrementalHoareTripleChecker+Valid, 7003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:14,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30026 Valid, 8625 Invalid, 11663 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4660 Valid, 7003 Invalid, 0 Unknown, 0 Unchecked, 14.5s Time] [2025-02-06 02:42:14,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135149 states. [2025-02-06 02:42:17,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135149 to 20589. [2025-02-06 02:42:17,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20589 states, 18722 states have (on average 1.5520243563721825) internal successors, (29057), 18774 states have internal predecessors, (29057), 1749 states have call successors, (1749), 117 states have call predecessors, (1749), 117 states have return successors, (1749), 1697 states have call predecessors, (1749), 1749 states have call successors, (1749) [2025-02-06 02:42:17,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20589 states to 20589 states and 32555 transitions. [2025-02-06 02:42:17,084 INFO L78 Accepts]: Start accepts. Automaton has 20589 states and 32555 transitions. Word has length 594 [2025-02-06 02:42:17,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:17,085 INFO L471 AbstractCegarLoop]: Abstraction has 20589 states and 32555 transitions. [2025-02-06 02:42:17,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.238095238095238) internal successors, (152), 21 states have internal predecessors, (152), 1 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 1 states have call predecessors, (89), 1 states have call successors, (89) [2025-02-06 02:42:17,085 INFO L276 IsEmpty]: Start isEmpty. Operand 20589 states and 32555 transitions. [2025-02-06 02:42:17,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-02-06 02:42:17,116 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:17,116 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:42:17,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 02:42:17,117 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:17,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:17,118 INFO L85 PathProgramCache]: Analyzing trace with hash -962233024, now seen corresponding path program 1 times [2025-02-06 02:42:17,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:17,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50250534] [2025-02-06 02:42:17,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:17,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:17,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-02-06 02:42:17,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-02-06 02:42:17,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:17,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:20,433 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15664 trivial. 0 not checked. [2025-02-06 02:42:20,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:20,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50250534] [2025-02-06 02:42:20,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50250534] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:42:20,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:42:20,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-06 02:42:20,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971014559] [2025-02-06 02:42:20,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:42:20,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 02:42:20,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:20,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 02:42:20,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2025-02-06 02:42:20,436 INFO L87 Difference]: Start difference. First operand 20589 states and 32555 transitions. Second operand has 16 states, 16 states have (on average 9.5) internal successors, (152), 16 states have internal predecessors, (152), 2 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 2 states have call predecessors, (89), 2 states have call successors, (89) [2025-02-06 02:42:31,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:31,934 INFO L93 Difference]: Finished difference Result 131309 states and 208840 transitions. [2025-02-06 02:42:31,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 02:42:31,935 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.5) internal successors, (152), 16 states have internal predecessors, (152), 2 states have call successors, (89), 1 states have call predecessors, (89), 1 states have return successors, (89), 2 states have call predecessors, (89), 2 states have call successors, (89) Word has length 594 [2025-02-06 02:42:31,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:32,140 INFO L225 Difference]: With dead ends: 131309 [2025-02-06 02:42:32,141 INFO L226 Difference]: Without dead ends: 110887 [2025-02-06 02:42:32,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=198, Invalid=672, Unknown=0, NotChecked=0, Total=870 [2025-02-06 02:42:32,196 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 6479 mSDsluCounter, 7766 mSDsCounter, 0 mSdLazyCounter, 3970 mSolverCounterSat, 816 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6479 SdHoareTripleChecker+Valid, 8618 SdHoareTripleChecker+Invalid, 4786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 816 IncrementalHoareTripleChecker+Valid, 3970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:32,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6479 Valid, 8618 Invalid, 4786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [816 Valid, 3970 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2025-02-06 02:42:32,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110887 states.