./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-59.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 c3eff42a8b8c884ae11f90d187410b4308f7ccc8d2492e13c8b7c80478f2454e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:06:25,936 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:06:25,989 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 10:06:25,994 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:06:25,994 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:06:26,021 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:06:26,022 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:06:26,022 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:06:26,023 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:06:26,023 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:06:26,024 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:06:26,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:06:26,024 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:06:26,024 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:06:26,024 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:06:26,024 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:06:26,024 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:06:26,024 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:06:26,024 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:06:26,024 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:06:26,024 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:06:26,024 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:06:26,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:06:26,024 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:06:26,024 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:06:26,025 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:06:26,025 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:06:26,025 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:06:26,025 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:06:26,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:06:26,025 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:06:26,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:06:26,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:06:26,025 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:06:26,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:06:26,025 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:06:26,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:06:26,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:06:26,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:06:26,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:06:26,025 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:06:26,025 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:06:26,025 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:06:26,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:06:26,027 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:06:26,027 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:06:26,027 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:06:26,027 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:06:26,027 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 -> c3eff42a8b8c884ae11f90d187410b4308f7ccc8d2492e13c8b7c80478f2454e [2025-01-09 10:06:26,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:06:26,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:06:26,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:06:26,262 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:06:26,262 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:06:26,264 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-59.i [2025-01-09 10:06:27,455 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b4556a1a0/8511ceec392a4f1a8570fa226747ac76/FLAGec30f34b1 [2025-01-09 10:06:27,766 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:06:27,767 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-59.i [2025-01-09 10:06:27,787 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b4556a1a0/8511ceec392a4f1a8570fa226747ac76/FLAGec30f34b1 [2025-01-09 10:06:28,018 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b4556a1a0/8511ceec392a4f1a8570fa226747ac76 [2025-01-09 10:06:28,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:06:28,021 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:06:28,022 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:06:28,022 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:06:28,025 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:06:28,026 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:06:28" (1/1) ... [2025-01-09 10:06:28,026 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f1633bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:28, skipping insertion in model container [2025-01-09 10:06:28,027 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:06:28" (1/1) ... [2025-01-09 10:06:28,056 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:06:28,168 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_fillercode_fillercodesize_ps-cn-500_file-59.i[916,929] [2025-01-09 10:06:28,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:06:28,367 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:06:28,376 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_fillercode_fillercodesize_ps-cn-500_file-59.i[916,929] [2025-01-09 10:06:28,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:06:28,470 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:06:28,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:28 WrapperNode [2025-01-09 10:06:28,470 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:06:28,471 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:06:28,471 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:06:28,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:06:28,477 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:28" (1/1) ... [2025-01-09 10:06:28,495 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:28" (1/1) ... [2025-01-09 10:06:28,562 INFO L138 Inliner]: procedures = 26, calls = 129, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 889 [2025-01-09 10:06:28,562 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:06:28,563 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:06:28,563 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:06:28,564 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:06:28,574 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:28" (1/1) ... [2025-01-09 10:06:28,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:28" (1/1) ... [2025-01-09 10:06:28,587 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:28" (1/1) ... [2025-01-09 10:06:28,624 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 10:06:28,627 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:28" (1/1) ... [2025-01-09 10:06:28,628 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:28" (1/1) ... [2025-01-09 10:06:28,647 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:28" (1/1) ... [2025-01-09 10:06:28,651 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:28" (1/1) ... [2025-01-09 10:06:28,660 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:28" (1/1) ... [2025-01-09 10:06:28,665 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:28" (1/1) ... [2025-01-09 10:06:28,671 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:28" (1/1) ... [2025-01-09 10:06:28,680 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:06:28,680 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:06:28,680 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:06:28,681 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:06:28,682 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:28" (1/1) ... [2025-01-09 10:06:28,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:06:28,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:06:28,709 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 10:06:28,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 10:06:28,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:06:28,732 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:06:28,732 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:06:28,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:06:28,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:06:28,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:06:28,849 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:06:28,851 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:06:29,995 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-01-09 10:06:29,996 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:06:30,019 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:06:30,019 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:06:30,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:06:30 BoogieIcfgContainer [2025-01-09 10:06:30,019 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:06:30,021 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:06:30,021 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:06:30,025 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:06:30,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:06:28" (1/3) ... [2025-01-09 10:06:30,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ad4c18a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:06:30, skipping insertion in model container [2025-01-09 10:06:30,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:28" (2/3) ... [2025-01-09 10:06:30,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ad4c18a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:06:30, skipping insertion in model container [2025-01-09 10:06:30,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:06:30" (3/3) ... [2025-01-09 10:06:30,029 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-59.i [2025-01-09 10:06:30,041 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:06:30,046 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-59.i that has 2 procedures, 371 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:06:30,111 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:06:30,120 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;@744ed86a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:06:30,120 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:06:30,126 INFO L276 IsEmpty]: Start isEmpty. Operand has 371 states, 252 states have (on average 1.5753968253968254) internal successors, (397), 253 states have internal predecessors, (397), 116 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2025-01-09 10:06:30,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 732 [2025-01-09 10:06:30,153 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:06:30,154 INFO L218 NwaCegarLoop]: trace histogram [116, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:06:30,155 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:06:30,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:06:30,159 INFO L85 PathProgramCache]: Analyzing trace with hash -792294752, now seen corresponding path program 1 times [2025-01-09 10:06:30,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:06:30,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761756851] [2025-01-09 10:06:30,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:06:30,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:06:30,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 731 statements into 1 equivalence classes. [2025-01-09 10:06:30,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 731 of 731 statements. [2025-01-09 10:06:30,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:06:30,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:06:30,788 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 0 proven. 230 refuted. 0 times theorem prover too weak. 26450 trivial. 0 not checked. [2025-01-09 10:06:30,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:06:30,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761756851] [2025-01-09 10:06:30,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761756851] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:06:30,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069922700] [2025-01-09 10:06:30,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:06:30,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:06:30,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:06:30,792 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:06:30,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 10:06:30,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 731 statements into 1 equivalence classes. [2025-01-09 10:06:31,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 731 of 731 statements. [2025-01-09 10:06:31,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:06:31,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:06:31,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 1634 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:06:31,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:06:31,267 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 26450 trivial. 0 not checked. [2025-01-09 10:06:31,268 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:06:31,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069922700] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:06:31,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:06:31,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:06:31,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747884748] [2025-01-09 10:06:31,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:06:31,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:06:31,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:06:31,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:06:31,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:06:31,291 INFO L87 Difference]: Start difference. First operand has 371 states, 252 states have (on average 1.5753968253968254) internal successors, (397), 253 states have internal predecessors, (397), 116 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) Second operand has 2 states, 2 states have (on average 78.0) internal successors, (156), 2 states have internal predecessors, (156), 2 states have call successors, (116), 2 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 2 states have call successors, (116) [2025-01-09 10:06:31,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:06:31,340 INFO L93 Difference]: Finished difference Result 736 states and 1369 transitions. [2025-01-09 10:06:31,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:06:31,342 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 78.0) internal successors, (156), 2 states have internal predecessors, (156), 2 states have call successors, (116), 2 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 2 states have call successors, (116) Word has length 731 [2025-01-09 10:06:31,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:06:31,349 INFO L225 Difference]: With dead ends: 736 [2025-01-09 10:06:31,350 INFO L226 Difference]: Without dead ends: 368 [2025-01-09 10:06:31,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 732 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:06:31,359 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:06:31,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:06:31,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-01-09 10:06:31,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2025-01-09 10:06:31,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 250 states have (on average 1.568) internal successors, (392), 250 states have internal predecessors, (392), 116 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2025-01-09 10:06:31,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 624 transitions. [2025-01-09 10:06:31,447 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 624 transitions. Word has length 731 [2025-01-09 10:06:31,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:06:31,448 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 624 transitions. [2025-01-09 10:06:31,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 78.0) internal successors, (156), 2 states have internal predecessors, (156), 2 states have call successors, (116), 2 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 2 states have call successors, (116) [2025-01-09 10:06:31,449 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 624 transitions. [2025-01-09 10:06:31,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 732 [2025-01-09 10:06:31,466 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:06:31,466 INFO L218 NwaCegarLoop]: trace histogram [116, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:06:31,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 10:06:31,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 10:06:31,671 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:06:31,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:06:31,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1641045388, now seen corresponding path program 1 times [2025-01-09 10:06:31,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:06:31,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463915228] [2025-01-09 10:06:31,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:06:31,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:06:31,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 731 statements into 1 equivalence classes. [2025-01-09 10:06:31,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 731 of 731 statements. [2025-01-09 10:06:31,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:06:31,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:06:32,730 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26680 trivial. 0 not checked. [2025-01-09 10:06:32,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:06:32,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463915228] [2025-01-09 10:06:32,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463915228] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:06:32,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:06:32,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:06:32,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362327694] [2025-01-09 10:06:32,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:06:32,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:06:32,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:06:32,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:06:32,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:06:32,734 INFO L87 Difference]: Start difference. First operand 368 states and 624 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 2 states have call predecessors, (116), 2 states have call successors, (116) [2025-01-09 10:06:33,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:06:33,282 INFO L93 Difference]: Finished difference Result 1097 states and 1864 transitions. [2025-01-09 10:06:33,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:06:33,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 2 states have call predecessors, (116), 2 states have call successors, (116) Word has length 731 [2025-01-09 10:06:33,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:06:33,293 INFO L225 Difference]: With dead ends: 1097 [2025-01-09 10:06:33,293 INFO L226 Difference]: Without dead ends: 732 [2025-01-09 10:06:33,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:06:33,295 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 695 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 1805 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:06:33,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 1805 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 10:06:33,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2025-01-09 10:06:33,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 730. [2025-01-09 10:06:33,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 495 states have (on average 1.5696969696969696) internal successors, (777), 495 states have internal predecessors, (777), 232 states have call successors, (232), 2 states have call predecessors, (232), 2 states have return successors, (232), 232 states have call predecessors, (232), 232 states have call successors, (232) [2025-01-09 10:06:33,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1241 transitions. [2025-01-09 10:06:33,383 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1241 transitions. Word has length 731 [2025-01-09 10:06:33,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:06:33,387 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 1241 transitions. [2025-01-09 10:06:33,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 2 states have call predecessors, (116), 2 states have call successors, (116) [2025-01-09 10:06:33,387 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1241 transitions. [2025-01-09 10:06:33,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 732 [2025-01-09 10:06:33,404 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:06:33,404 INFO L218 NwaCegarLoop]: trace histogram [116, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:06:33,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:06:33,406 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:06:33,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:06:33,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1697281498, now seen corresponding path program 1 times [2025-01-09 10:06:33,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:06:33,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516148737] [2025-01-09 10:06:33,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:06:33,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:06:33,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 731 statements into 1 equivalence classes. [2025-01-09 10:06:33,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 731 of 731 statements. [2025-01-09 10:06:33,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:06:33,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:06:33,887 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26680 trivial. 0 not checked. [2025-01-09 10:06:33,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:06:33,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516148737] [2025-01-09 10:06:33,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516148737] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:06:33,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:06:33,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:06:33,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154226391] [2025-01-09 10:06:33,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:06:33,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:06:33,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:06:33,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:06:33,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:06:33,893 INFO L87 Difference]: Start difference. First operand 730 states and 1241 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-01-09 10:06:34,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:06:34,045 INFO L93 Difference]: Finished difference Result 2184 states and 3717 transitions. [2025-01-09 10:06:34,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:06:34,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) Word has length 731 [2025-01-09 10:06:34,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:06:34,055 INFO L225 Difference]: With dead ends: 2184 [2025-01-09 10:06:34,055 INFO L226 Difference]: Without dead ends: 1457 [2025-01-09 10:06:34,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:06:34,058 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 421 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:06:34,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 1166 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:06:34,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2025-01-09 10:06:34,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1449. [2025-01-09 10:06:34,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1449 states, 980 states have (on average 1.5693877551020408) internal successors, (1538), 980 states have internal predecessors, (1538), 464 states have call successors, (464), 4 states have call predecessors, (464), 4 states have return successors, (464), 464 states have call predecessors, (464), 464 states have call successors, (464) [2025-01-09 10:06:34,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 2466 transitions. [2025-01-09 10:06:34,226 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 2466 transitions. Word has length 731 [2025-01-09 10:06:34,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:06:34,227 INFO L471 AbstractCegarLoop]: Abstraction has 1449 states and 2466 transitions. [2025-01-09 10:06:34,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-01-09 10:06:34,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 2466 transitions. [2025-01-09 10:06:34,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 732 [2025-01-09 10:06:34,233 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:06:34,233 INFO L218 NwaCegarLoop]: trace histogram [116, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:06:34,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:06:34,233 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:06:34,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:06:34,234 INFO L85 PathProgramCache]: Analyzing trace with hash 2105059624, now seen corresponding path program 1 times [2025-01-09 10:06:34,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:06:34,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464808317] [2025-01-09 10:06:34,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:06:34,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:06:34,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 731 statements into 1 equivalence classes. [2025-01-09 10:06:34,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 731 of 731 statements. [2025-01-09 10:06:34,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:06:34,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:06:34,492 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26680 trivial. 0 not checked. [2025-01-09 10:06:34,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:06:34,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464808317] [2025-01-09 10:06:34,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464808317] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:06:34,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:06:34,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:06:34,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757581028] [2025-01-09 10:06:34,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:06:34,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:06:34,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:06:34,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:06:34,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:06:34,495 INFO L87 Difference]: Start difference. First operand 1449 states and 2466 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-01-09 10:06:34,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:06:34,595 INFO L93 Difference]: Finished difference Result 3751 states and 6418 transitions. [2025-01-09 10:06:34,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:06:34,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) Word has length 731 [2025-01-09 10:06:34,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:06:34,610 INFO L225 Difference]: With dead ends: 3751 [2025-01-09 10:06:34,610 INFO L226 Difference]: Without dead ends: 2305 [2025-01-09 10:06:34,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:06:34,616 INFO L435 NwaCegarLoop]: 812 mSDtfsCounter, 364 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:06:34,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 1421 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:06:34,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2025-01-09 10:06:34,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 2299. [2025-01-09 10:06:34,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2299 states, 1698 states have (on average 1.6219081272084805) internal successors, (2754), 1702 states have internal predecessors, (2754), 592 states have call successors, (592), 8 states have call predecessors, (592), 8 states have return successors, (592), 588 states have call predecessors, (592), 592 states have call successors, (592) [2025-01-09 10:06:34,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2299 states to 2299 states and 3938 transitions. [2025-01-09 10:06:34,867 INFO L78 Accepts]: Start accepts. Automaton has 2299 states and 3938 transitions. Word has length 731 [2025-01-09 10:06:34,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:06:34,868 INFO L471 AbstractCegarLoop]: Abstraction has 2299 states and 3938 transitions. [2025-01-09 10:06:34,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-01-09 10:06:34,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2299 states and 3938 transitions. [2025-01-09 10:06:34,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2025-01-09 10:06:34,878 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:06:34,878 INFO L218 NwaCegarLoop]: trace histogram [116, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:06:34,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:06:34,879 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:06:34,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:06:34,879 INFO L85 PathProgramCache]: Analyzing trace with hash 308225355, now seen corresponding path program 1 times [2025-01-09 10:06:34,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:06:34,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118513482] [2025-01-09 10:06:34,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:06:34,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:06:34,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 732 statements into 1 equivalence classes. [2025-01-09 10:06:34,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 732 of 732 statements. [2025-01-09 10:06:34,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:06:34,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:06:35,117 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26680 trivial. 0 not checked. [2025-01-09 10:06:35,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:06:35,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118513482] [2025-01-09 10:06:35,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118513482] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:06:35,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:06:35,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:06:35,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565100313] [2025-01-09 10:06:35,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:06:35,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:06:35,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:06:35,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:06:35,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:06:35,119 INFO L87 Difference]: Start difference. First operand 2299 states and 3938 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-01-09 10:06:35,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:06:35,252 INFO L93 Difference]: Finished difference Result 5462 states and 9351 transitions. [2025-01-09 10:06:35,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:06:35,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) Word has length 732 [2025-01-09 10:06:35,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:06:35,272 INFO L225 Difference]: With dead ends: 5462 [2025-01-09 10:06:35,272 INFO L226 Difference]: Without dead ends: 3166 [2025-01-09 10:06:35,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:06:35,280 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 301 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:06:35,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 1302 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:06:35,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3166 states. [2025-01-09 10:06:35,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3166 to 3159. [2025-01-09 10:06:35,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3159 states, 2410 states have (on average 1.6224066390041494) internal successors, (3910), 2419 states have internal predecessors, (3910), 732 states have call successors, (732), 16 states have call predecessors, (732), 16 states have return successors, (732), 723 states have call predecessors, (732), 732 states have call successors, (732) [2025-01-09 10:06:35,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3159 states to 3159 states and 5374 transitions. [2025-01-09 10:06:35,536 INFO L78 Accepts]: Start accepts. Automaton has 3159 states and 5374 transitions. Word has length 732 [2025-01-09 10:06:35,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:06:35,537 INFO L471 AbstractCegarLoop]: Abstraction has 3159 states and 5374 transitions. [2025-01-09 10:06:35,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-01-09 10:06:35,538 INFO L276 IsEmpty]: Start isEmpty. Operand 3159 states and 5374 transitions. [2025-01-09 10:06:35,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2025-01-09 10:06:35,544 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:06:35,544 INFO L218 NwaCegarLoop]: trace histogram [116, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:06:35,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:06:35,545 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:06:35,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:06:35,545 INFO L85 PathProgramCache]: Analyzing trace with hash -509423095, now seen corresponding path program 1 times [2025-01-09 10:06:35,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:06:35,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988598740] [2025-01-09 10:06:35,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:06:35,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:06:35,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 732 statements into 1 equivalence classes. [2025-01-09 10:06:35,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 732 of 732 statements. [2025-01-09 10:06:35,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:06:35,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:06:35,870 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26680 trivial. 0 not checked. [2025-01-09 10:06:35,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:06:35,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988598740] [2025-01-09 10:06:35,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988598740] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:06:35,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:06:35,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:06:35,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678103738] [2025-01-09 10:06:35,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:06:35,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:06:35,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:06:35,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:06:35,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:06:35,873 INFO L87 Difference]: Start difference. First operand 3159 states and 5374 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-01-09 10:06:36,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:06:36,132 INFO L93 Difference]: Finished difference Result 9383 states and 15972 transitions. [2025-01-09 10:06:36,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:06:36,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) Word has length 732 [2025-01-09 10:06:36,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:06:36,172 INFO L225 Difference]: With dead ends: 9383 [2025-01-09 10:06:36,172 INFO L226 Difference]: Without dead ends: 6271 [2025-01-09 10:06:36,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:06:36,184 INFO L435 NwaCegarLoop]: 621 mSDtfsCounter, 392 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:06:36,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 1236 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:06:36,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6271 states. [2025-01-09 10:06:36,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6271 to 6257. [2025-01-09 10:06:36,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6257 states, 4788 states have (on average 1.6215538847117794) internal successors, (7764), 4805 states have internal predecessors, (7764), 1436 states have call successors, (1436), 32 states have call predecessors, (1436), 32 states have return successors, (1436), 1419 states have call predecessors, (1436), 1436 states have call successors, (1436) [2025-01-09 10:06:36,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6257 states to 6257 states and 10636 transitions. [2025-01-09 10:06:36,769 INFO L78 Accepts]: Start accepts. Automaton has 6257 states and 10636 transitions. Word has length 732 [2025-01-09 10:06:36,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:06:36,770 INFO L471 AbstractCegarLoop]: Abstraction has 6257 states and 10636 transitions. [2025-01-09 10:06:36,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-01-09 10:06:36,771 INFO L276 IsEmpty]: Start isEmpty. Operand 6257 states and 10636 transitions. [2025-01-09 10:06:36,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2025-01-09 10:06:36,783 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:06:36,783 INFO L218 NwaCegarLoop]: trace histogram [116, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:06:36,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:06:36,784 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:06:36,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:06:36,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1940177035, now seen corresponding path program 1 times [2025-01-09 10:06:36,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:06:36,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242659663] [2025-01-09 10:06:36,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:06:36,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:06:36,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 732 statements into 1 equivalence classes. [2025-01-09 10:06:36,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 732 of 732 statements. [2025-01-09 10:06:36,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:06:36,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:06:37,134 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26680 trivial. 0 not checked. [2025-01-09 10:06:37,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:06:37,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242659663] [2025-01-09 10:06:37,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242659663] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:06:37,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:06:37,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:06:37,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496851878] [2025-01-09 10:06:37,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:06:37,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:06:37,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:06:37,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:06:37,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:06:37,142 INFO L87 Difference]: Start difference. First operand 6257 states and 10636 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-01-09 10:06:38,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:06:38,390 INFO L93 Difference]: Finished difference Result 24863 states and 42283 transitions. [2025-01-09 10:06:38,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:06:38,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) Word has length 732 [2025-01-09 10:06:38,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:06:38,478 INFO L225 Difference]: With dead ends: 24863 [2025-01-09 10:06:38,479 INFO L226 Difference]: Without dead ends: 18653 [2025-01-09 10:06:38,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:06:38,501 INFO L435 NwaCegarLoop]: 1071 mSDtfsCounter, 943 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 943 SdHoareTripleChecker+Valid, 2070 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 10:06:38,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [943 Valid, 2070 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 10:06:38,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18653 states. [2025-01-09 10:06:39,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18653 to 18649. [2025-01-09 10:06:39,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18649 states, 14300 states have (on average 1.6218181818181818) internal successors, (23192), 14349 states have internal predecessors, (23192), 4252 states have call successors, (4252), 96 states have call predecessors, (4252), 96 states have return successors, (4252), 4203 states have call predecessors, (4252), 4252 states have call successors, (4252) [2025-01-09 10:06:40,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18649 states to 18649 states and 31696 transitions. [2025-01-09 10:06:40,053 INFO L78 Accepts]: Start accepts. Automaton has 18649 states and 31696 transitions. Word has length 732 [2025-01-09 10:06:40,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:06:40,055 INFO L471 AbstractCegarLoop]: Abstraction has 18649 states and 31696 transitions. [2025-01-09 10:06:40,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-01-09 10:06:40,055 INFO L276 IsEmpty]: Start isEmpty. Operand 18649 states and 31696 transitions. [2025-01-09 10:06:40,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2025-01-09 10:06:40,070 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:06:40,070 INFO L218 NwaCegarLoop]: trace histogram [116, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:06:40,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:06:40,071 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:06:40,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:06:40,071 INFO L85 PathProgramCache]: Analyzing trace with hash -493219063, now seen corresponding path program 1 times [2025-01-09 10:06:40,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:06:40,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419392307] [2025-01-09 10:06:40,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:06:40,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:06:40,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 732 statements into 1 equivalence classes. [2025-01-09 10:06:40,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 732 of 732 statements. [2025-01-09 10:06:40,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:06:40,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:06:40,828 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26680 trivial. 0 not checked. [2025-01-09 10:06:40,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:06:40,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419392307] [2025-01-09 10:06:40,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419392307] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:06:40,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:06:40,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:06:40,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134225652] [2025-01-09 10:06:40,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:06:40,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:06:40,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:06:40,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:06:40,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:06:40,830 INFO L87 Difference]: Start difference. First operand 18649 states and 31696 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-01-09 10:06:43,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:06:43,014 INFO L93 Difference]: Finished difference Result 72661 states and 123875 transitions. [2025-01-09 10:06:43,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:06:43,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) Word has length 732 [2025-01-09 10:06:43,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:06:43,226 INFO L225 Difference]: With dead ends: 72661 [2025-01-09 10:06:43,226 INFO L226 Difference]: Without dead ends: 54059 [2025-01-09 10:06:43,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:06:43,402 INFO L435 NwaCegarLoop]: 765 mSDtfsCounter, 1013 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1013 SdHoareTripleChecker+Valid, 2077 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:06:43,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1013 Valid, 2077 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 10:06:43,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54059 states. [2025-01-09 10:06:45,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54059 to 53885. [2025-01-09 10:06:45,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53885 states, 44975 states have (on average 1.6641022790439133) internal successors, (74843), 45240 states have internal predecessors, (74843), 8572 states have call successors, (8572), 337 states have call predecessors, (8572), 337 states have return successors, (8572), 8307 states have call predecessors, (8572), 8572 states have call successors, (8572) [2025-01-09 10:06:45,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53885 states to 53885 states and 91987 transitions. [2025-01-09 10:06:45,753 INFO L78 Accepts]: Start accepts. Automaton has 53885 states and 91987 transitions. Word has length 732 [2025-01-09 10:06:45,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:06:45,755 INFO L471 AbstractCegarLoop]: Abstraction has 53885 states and 91987 transitions. [2025-01-09 10:06:45,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-01-09 10:06:45,755 INFO L276 IsEmpty]: Start isEmpty. Operand 53885 states and 91987 transitions. [2025-01-09 10:06:45,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2025-01-09 10:06:45,804 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:06:45,804 INFO L218 NwaCegarLoop]: trace histogram [116, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:06:45,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:06:45,805 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:06:45,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:06:45,806 INFO L85 PathProgramCache]: Analyzing trace with hash -49318389, now seen corresponding path program 1 times [2025-01-09 10:06:45,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:06:45,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030764] [2025-01-09 10:06:45,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:06:45,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:06:45,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 732 statements into 1 equivalence classes. [2025-01-09 10:06:45,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 732 of 732 statements. [2025-01-09 10:06:45,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:06:45,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:06:46,283 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26680 trivial. 0 not checked. [2025-01-09 10:06:46,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:06:46,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030764] [2025-01-09 10:06:46,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030764] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:06:46,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:06:46,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:06:46,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028273452] [2025-01-09 10:06:46,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:06:46,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:06:46,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:06:46,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:06:46,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:06:46,286 INFO L87 Difference]: Start difference. First operand 53885 states and 91987 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-01-09 10:06:49,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:06:49,314 INFO L93 Difference]: Finished difference Result 161481 states and 275661 transitions. [2025-01-09 10:06:49,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:06:49,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) Word has length 732 [2025-01-09 10:06:49,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:06:49,697 INFO L225 Difference]: With dead ends: 161481 [2025-01-09 10:06:49,697 INFO L226 Difference]: Without dead ends: 107647 [2025-01-09 10:06:49,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:06:49,812 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 373 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:06:49,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 1238 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:06:49,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107647 states. [2025-01-09 10:06:54,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107647 to 107645. [2025-01-09 10:06:54,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107645 states, 89855 states have (on average 1.65999666128763) internal successors, (149159), 90384 states have internal predecessors, (149159), 17116 states have call successors, (17116), 673 states have call predecessors, (17116), 673 states have return successors, (17116), 16587 states have call predecessors, (17116), 17116 states have call successors, (17116) [2025-01-09 10:06:54,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107645 states to 107645 states and 183391 transitions. [2025-01-09 10:06:54,882 INFO L78 Accepts]: Start accepts. Automaton has 107645 states and 183391 transitions. Word has length 732 [2025-01-09 10:06:54,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:06:54,883 INFO L471 AbstractCegarLoop]: Abstraction has 107645 states and 183391 transitions. [2025-01-09 10:06:54,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-01-09 10:06:54,884 INFO L276 IsEmpty]: Start isEmpty. Operand 107645 states and 183391 transitions. [2025-01-09 10:06:54,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2025-01-09 10:06:54,962 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:06:54,963 INFO L218 NwaCegarLoop]: trace histogram [116, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:06:54,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:06:54,963 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:06:54,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:06:54,964 INFO L85 PathProgramCache]: Analyzing trace with hash 169536329, now seen corresponding path program 1 times [2025-01-09 10:06:54,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:06:54,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685378283] [2025-01-09 10:06:54,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:06:54,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:06:54,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 732 statements into 1 equivalence classes. [2025-01-09 10:06:55,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 732 of 732 statements. [2025-01-09 10:06:55,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:06:55,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:06:55,503 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26680 trivial. 0 not checked. [2025-01-09 10:06:55,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:06:55,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685378283] [2025-01-09 10:06:55,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685378283] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:06:55,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:06:55,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:06:55,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415430963] [2025-01-09 10:06:55,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:06:55,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:06:55,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:06:55,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:06:55,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:06:55,507 INFO L87 Difference]: Start difference. First operand 107645 states and 183391 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-01-09 10:07:00,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:00,429 INFO L93 Difference]: Finished difference Result 304041 states and 517905 transitions. [2025-01-09 10:07:00,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:07:00,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) Word has length 732 [2025-01-09 10:07:00,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:01,386 INFO L225 Difference]: With dead ends: 304041 [2025-01-09 10:07:01,387 INFO L226 Difference]: Without dead ends: 196447 [2025-01-09 10:07:01,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:07:01,557 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 365 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:01,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1230 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:07:01,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196447 states.