./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-87.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-250_file-87.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 6257c3f163e6ff273e80adb62a710763b7566e9519a02e63ef5b17a79923aac8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:48:05,855 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:48:05,901 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:48:05,907 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:48:05,912 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:48:05,939 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:48:05,940 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:48:05,941 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:48:05,941 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:48:05,941 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:48:05,941 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:48:05,941 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:48:05,942 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:48:05,942 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:48:05,942 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:48:05,942 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:48:05,942 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:48:05,942 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:48:05,942 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:48:05,942 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:48:05,942 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:48:05,942 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:48:05,942 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:48:05,942 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:48:05,942 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:48:05,942 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:48:05,942 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:48:05,942 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:48:05,942 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:48:05,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:48:05,942 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:48:05,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:48:05,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:48:05,943 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:48:05,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:48:05,943 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:48:05,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:48:05,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:48:05,943 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:48:05,943 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:48:05,943 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:48:05,943 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:48:05,943 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:48:05,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:48:05,943 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:48:05,943 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:48:05,943 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:48:05,943 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:48:05,943 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 -> 6257c3f163e6ff273e80adb62a710763b7566e9519a02e63ef5b17a79923aac8 [2025-01-09 09:48:06,176 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:48:06,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:48:06,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:48:06,185 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:48:06,185 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:48:06,186 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-250_file-87.i [2025-01-09 09:48:07,307 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d3eca47c/9ec11ae2d31540bdbbd82bf5b6a07c32/FLAGa672b7fa5 [2025-01-09 09:48:07,576 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:48:07,577 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-87.i [2025-01-09 09:48:07,587 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d3eca47c/9ec11ae2d31540bdbbd82bf5b6a07c32/FLAGa672b7fa5 [2025-01-09 09:48:07,889 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d3eca47c/9ec11ae2d31540bdbbd82bf5b6a07c32 [2025-01-09 09:48:07,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:48:07,893 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:48:07,894 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:48:07,894 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:48:07,897 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:48:07,897 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:48:07" (1/1) ... [2025-01-09 09:48:07,898 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@665f6699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:07, skipping insertion in model container [2025-01-09 09:48:07,898 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:48:07" (1/1) ... [2025-01-09 09:48:07,915 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:48:08,018 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-250_file-87.i[916,929] [2025-01-09 09:48:08,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:48:08,152 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:48:08,162 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-250_file-87.i[916,929] [2025-01-09 09:48:08,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:48:08,251 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:48:08,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:08 WrapperNode [2025-01-09 09:48:08,252 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:48:08,253 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:48:08,254 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:48:08,254 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:48:08,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:08" (1/1) ... [2025-01-09 09:48:08,271 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:08" (1/1) ... [2025-01-09 09:48:08,317 INFO L138 Inliner]: procedures = 26, calls = 107, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 599 [2025-01-09 09:48:08,317 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:48:08,317 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:48:08,318 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:48:08,318 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:48:08,324 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:08" (1/1) ... [2025-01-09 09:48:08,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:08" (1/1) ... [2025-01-09 09:48:08,336 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:08" (1/1) ... [2025-01-09 09:48:08,365 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 09:48:08,365 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:08" (1/1) ... [2025-01-09 09:48:08,365 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:08" (1/1) ... [2025-01-09 09:48:08,388 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:08" (1/1) ... [2025-01-09 09:48:08,392 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:08" (1/1) ... [2025-01-09 09:48:08,402 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:08" (1/1) ... [2025-01-09 09:48:08,409 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:08" (1/1) ... [2025-01-09 09:48:08,413 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:08" (1/1) ... [2025-01-09 09:48:08,422 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:48:08,424 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:48:08,424 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:48:08,424 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:48:08,425 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:08" (1/1) ... [2025-01-09 09:48:08,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:48:08,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:48:08,451 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 09:48:08,454 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 09:48:08,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:48:08,474 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:48:08,474 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:48:08,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:48:08,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:48:08,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:48:08,581 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:48:08,582 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:48:09,334 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 09:48:09,334 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:48:09,344 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:48:09,345 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:48:09,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:48:09 BoogieIcfgContainer [2025-01-09 09:48:09,345 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:48:09,347 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:48:09,347 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:48:09,350 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:48:09,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:48:07" (1/3) ... [2025-01-09 09:48:09,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@575ce43a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:48:09, skipping insertion in model container [2025-01-09 09:48:09,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:08" (2/3) ... [2025-01-09 09:48:09,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@575ce43a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:48:09, skipping insertion in model container [2025-01-09 09:48:09,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:48:09" (3/3) ... [2025-01-09 09:48:09,352 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-87.i [2025-01-09 09:48:09,363 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:48:09,366 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-87.i that has 2 procedures, 256 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:48:09,425 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:48:09,432 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;@3b70c4ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:48:09,433 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:48:09,437 INFO L276 IsEmpty]: Start isEmpty. Operand has 256 states, 159 states have (on average 1.5031446540880504) internal successors, (239), 160 states have internal predecessors, (239), 94 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 94 states have call predecessors, (94), 94 states have call successors, (94) [2025-01-09 09:48:09,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2025-01-09 09:48:09,459 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:09,460 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:09,461 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:09,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:09,465 INFO L85 PathProgramCache]: Analyzing trace with hash 893084280, now seen corresponding path program 1 times [2025-01-09 09:48:09,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:09,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169901621] [2025-01-09 09:48:09,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:09,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:09,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 577 statements into 1 equivalence classes. [2025-01-09 09:48:09,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 577 of 577 statements. [2025-01-09 09:48:09,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:09,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:09,983 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 186 refuted. 0 times theorem prover too weak. 17298 trivial. 0 not checked. [2025-01-09 09:48:09,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:09,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169901621] [2025-01-09 09:48:09,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169901621] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:48:09,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052943438] [2025-01-09 09:48:09,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:09,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:48:09,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:48:09,988 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 09:48:09,989 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 09:48:10,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 577 statements into 1 equivalence classes. [2025-01-09 09:48:10,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 577 of 577 statements. [2025-01-09 09:48:10,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:10,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:10,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 1259 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:48:10,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:48:10,288 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 17298 trivial. 0 not checked. [2025-01-09 09:48:10,288 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:48:10,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052943438] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:10,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:48:10,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:48:10,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127363334] [2025-01-09 09:48:10,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:10,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:48:10,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:10,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:48:10,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:48:10,314 INFO L87 Difference]: Start difference. First operand has 256 states, 159 states have (on average 1.5031446540880504) internal successors, (239), 160 states have internal predecessors, (239), 94 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 94 states have call predecessors, (94), 94 states have call successors, (94) Second operand has 2 states, 2 states have (on average 56.0) internal successors, (112), 2 states have internal predecessors, (112), 2 states have call successors, (94), 2 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 2 states have call successors, (94) [2025-01-09 09:48:10,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:10,361 INFO L93 Difference]: Finished difference Result 506 states and 943 transitions. [2025-01-09 09:48:10,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:48:10,362 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 56.0) internal successors, (112), 2 states have internal predecessors, (112), 2 states have call successors, (94), 2 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 2 states have call successors, (94) Word has length 577 [2025-01-09 09:48:10,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:10,368 INFO L225 Difference]: With dead ends: 506 [2025-01-09 09:48:10,368 INFO L226 Difference]: Without dead ends: 253 [2025-01-09 09:48:10,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 578 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 09:48:10,376 INFO L435 NwaCegarLoop]: 420 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, 420 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 09:48:10,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:48:10,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-01-09 09:48:10,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2025-01-09 09:48:10,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 157 states have (on average 1.4777070063694266) internal successors, (232), 157 states have internal predecessors, (232), 94 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 94 states have call predecessors, (94), 94 states have call successors, (94) [2025-01-09 09:48:10,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 420 transitions. [2025-01-09 09:48:10,452 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 420 transitions. Word has length 577 [2025-01-09 09:48:10,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:10,453 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 420 transitions. [2025-01-09 09:48:10,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 56.0) internal successors, (112), 2 states have internal predecessors, (112), 2 states have call successors, (94), 2 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 2 states have call successors, (94) [2025-01-09 09:48:10,453 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 420 transitions. [2025-01-09 09:48:10,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 579 [2025-01-09 09:48:10,463 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:10,464 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:10,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 09:48:10,665 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 09:48:10,665 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:10,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:10,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1790338302, now seen corresponding path program 1 times [2025-01-09 09:48:10,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:10,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412021953] [2025-01-09 09:48:10,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:10,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:10,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 578 statements into 1 equivalence classes. [2025-01-09 09:48:10,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 578 of 578 statements. [2025-01-09 09:48:10,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:10,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:11,252 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-01-09 09:48:11,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:11,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412021953] [2025-01-09 09:48:11,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412021953] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:11,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:11,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:48:11,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878635825] [2025-01-09 09:48:11,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:11,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:48:11,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:11,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:48:11,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:48:11,260 INFO L87 Difference]: Start difference. First operand 253 states and 420 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-01-09 09:48:11,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:11,343 INFO L93 Difference]: Finished difference Result 667 states and 1114 transitions. [2025-01-09 09:48:11,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:48:11,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 578 [2025-01-09 09:48:11,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:11,351 INFO L225 Difference]: With dead ends: 667 [2025-01-09 09:48:11,352 INFO L226 Difference]: Without dead ends: 417 [2025-01-09 09:48:11,353 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 09:48:11,354 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 265 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:11,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 926 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:48:11,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-01-09 09:48:11,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 414. [2025-01-09 09:48:11,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 275 states have (on average 1.5345454545454544) internal successors, (422), 276 states have internal predecessors, (422), 136 states have call successors, (136), 2 states have call predecessors, (136), 2 states have return successors, (136), 135 states have call predecessors, (136), 136 states have call successors, (136) [2025-01-09 09:48:11,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 694 transitions. [2025-01-09 09:48:11,411 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 694 transitions. Word has length 578 [2025-01-09 09:48:11,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:11,413 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 694 transitions. [2025-01-09 09:48:11,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-01-09 09:48:11,414 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 694 transitions. [2025-01-09 09:48:11,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2025-01-09 09:48:11,423 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:11,423 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:11,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:48:11,426 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:11,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:11,426 INFO L85 PathProgramCache]: Analyzing trace with hash -719089035, now seen corresponding path program 1 times [2025-01-09 09:48:11,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:11,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075173486] [2025-01-09 09:48:11,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:11,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:11,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 579 statements into 1 equivalence classes. [2025-01-09 09:48:11,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 579 of 579 statements. [2025-01-09 09:48:11,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:11,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:11,688 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-01-09 09:48:11,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:11,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075173486] [2025-01-09 09:48:11,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075173486] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:11,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:11,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:48:11,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792659253] [2025-01-09 09:48:11,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:11,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:48:11,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:11,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:48:11,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:48:11,691 INFO L87 Difference]: Start difference. First operand 414 states and 694 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-01-09 09:48:11,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:11,762 INFO L93 Difference]: Finished difference Result 1113 states and 1867 transitions. [2025-01-09 09:48:11,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:48:11,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 579 [2025-01-09 09:48:11,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:11,771 INFO L225 Difference]: With dead ends: 1113 [2025-01-09 09:48:11,773 INFO L226 Difference]: Without dead ends: 702 [2025-01-09 09:48:11,774 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 09:48:11,776 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 253 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:11,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 935 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:48:11,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-01-09 09:48:11,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 699. [2025-01-09 09:48:11,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 467 states have (on average 1.5331905781584583) internal successors, (716), 470 states have internal predecessors, (716), 227 states have call successors, (227), 4 states have call predecessors, (227), 4 states have return successors, (227), 224 states have call predecessors, (227), 227 states have call successors, (227) [2025-01-09 09:48:11,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1170 transitions. [2025-01-09 09:48:11,857 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1170 transitions. Word has length 579 [2025-01-09 09:48:11,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:11,859 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 1170 transitions. [2025-01-09 09:48:11,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-01-09 09:48:11,859 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1170 transitions. [2025-01-09 09:48:11,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2025-01-09 09:48:11,865 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:11,866 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:11,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:48:11,866 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:11,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:11,867 INFO L85 PathProgramCache]: Analyzing trace with hash -657049421, now seen corresponding path program 1 times [2025-01-09 09:48:11,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:11,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743246727] [2025-01-09 09:48:11,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:11,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:11,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 579 statements into 1 equivalence classes. [2025-01-09 09:48:11,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 579 of 579 statements. [2025-01-09 09:48:11,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:11,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:12,112 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-01-09 09:48:12,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:12,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743246727] [2025-01-09 09:48:12,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743246727] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:12,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:12,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:48:12,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446839735] [2025-01-09 09:48:12,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:12,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:48:12,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:12,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:48:12,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:48:12,115 INFO L87 Difference]: Start difference. First operand 699 states and 1170 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-01-09 09:48:12,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:12,213 INFO L93 Difference]: Finished difference Result 1983 states and 3322 transitions. [2025-01-09 09:48:12,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:48:12,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 579 [2025-01-09 09:48:12,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:12,224 INFO L225 Difference]: With dead ends: 1983 [2025-01-09 09:48:12,225 INFO L226 Difference]: Without dead ends: 1287 [2025-01-09 09:48:12,227 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 09:48:12,229 INFO L435 NwaCegarLoop]: 644 mSDtfsCounter, 261 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:12,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 1051 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:48:12,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2025-01-09 09:48:12,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1284. [2025-01-09 09:48:12,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1284 states, 860 states have (on average 1.533720930232558) internal successors, (1319), 867 states have internal predecessors, (1319), 415 states have call successors, (415), 8 states have call predecessors, (415), 8 states have return successors, (415), 408 states have call predecessors, (415), 415 states have call successors, (415) [2025-01-09 09:48:12,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 2149 transitions. [2025-01-09 09:48:12,339 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 2149 transitions. Word has length 579 [2025-01-09 09:48:12,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:12,340 INFO L471 AbstractCegarLoop]: Abstraction has 1284 states and 2149 transitions. [2025-01-09 09:48:12,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-01-09 09:48:12,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 2149 transitions. [2025-01-09 09:48:12,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2025-01-09 09:48:12,346 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:12,346 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:12,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:48:12,346 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:12,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:12,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1051416207, now seen corresponding path program 1 times [2025-01-09 09:48:12,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:12,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559284496] [2025-01-09 09:48:12,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:12,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:12,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 579 statements into 1 equivalence classes. [2025-01-09 09:48:12,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 579 of 579 statements. [2025-01-09 09:48:12,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:12,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:12,590 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-01-09 09:48:12,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:12,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559284496] [2025-01-09 09:48:12,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559284496] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:12,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:12,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:48:12,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746246871] [2025-01-09 09:48:12,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:12,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:48:12,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:12,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:48:12,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:48:12,594 INFO L87 Difference]: Start difference. First operand 1284 states and 2149 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-01-09 09:48:12,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:12,736 INFO L93 Difference]: Finished difference Result 3726 states and 6217 transitions. [2025-01-09 09:48:12,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:48:12,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 579 [2025-01-09 09:48:12,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:12,758 INFO L225 Difference]: With dead ends: 3726 [2025-01-09 09:48:12,758 INFO L226 Difference]: Without dead ends: 2445 [2025-01-09 09:48:12,763 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 09:48:12,766 INFO L435 NwaCegarLoop]: 757 mSDtfsCounter, 393 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:12,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1154 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:48:12,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2445 states. [2025-01-09 09:48:12,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2445 to 2443. [2025-01-09 09:48:12,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2443 states, 1596 states have (on average 1.494987468671679) internal successors, (2386), 1610 states have internal predecessors, (2386), 830 states have call successors, (830), 16 states have call predecessors, (830), 16 states have return successors, (830), 816 states have call predecessors, (830), 830 states have call successors, (830) [2025-01-09 09:48:12,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 2443 states and 4046 transitions. [2025-01-09 09:48:12,995 INFO L78 Accepts]: Start accepts. Automaton has 2443 states and 4046 transitions. Word has length 579 [2025-01-09 09:48:12,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:12,996 INFO L471 AbstractCegarLoop]: Abstraction has 2443 states and 4046 transitions. [2025-01-09 09:48:12,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-01-09 09:48:12,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2443 states and 4046 transitions. [2025-01-09 09:48:13,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2025-01-09 09:48:13,001 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:13,001 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:13,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:48:13,001 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:13,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:13,002 INFO L85 PathProgramCache]: Analyzing trace with hash 942619057, now seen corresponding path program 1 times [2025-01-09 09:48:13,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:13,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403381669] [2025-01-09 09:48:13,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:13,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:13,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 579 statements into 1 equivalence classes. [2025-01-09 09:48:13,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 579 of 579 statements. [2025-01-09 09:48:13,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:13,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:13,584 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-01-09 09:48:13,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:13,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403381669] [2025-01-09 09:48:13,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403381669] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:13,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:13,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:48:13,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446007747] [2025-01-09 09:48:13,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:13,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:48:13,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:13,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:48:13,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:48:13,587 INFO L87 Difference]: Start difference. First operand 2443 states and 4046 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-01-09 09:48:14,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:14,384 INFO L93 Difference]: Finished difference Result 7201 states and 11931 transitions. [2025-01-09 09:48:14,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:48:14,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 579 [2025-01-09 09:48:14,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:14,414 INFO L225 Difference]: With dead ends: 7201 [2025-01-09 09:48:14,414 INFO L226 Difference]: Without dead ends: 4761 [2025-01-09 09:48:14,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:48:14,424 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 815 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:14,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 1074 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 09:48:14,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4761 states. [2025-01-09 09:48:14,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4761 to 3739. [2025-01-09 09:48:14,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3739 states, 2469 states have (on average 1.5002025111381125) internal successors, (3704), 2490 states have internal predecessors, (3704), 1245 states have call successors, (1245), 24 states have call predecessors, (1245), 24 states have return successors, (1245), 1224 states have call predecessors, (1245), 1245 states have call successors, (1245) [2025-01-09 09:48:14,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 6194 transitions. [2025-01-09 09:48:14,720 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 6194 transitions. Word has length 579 [2025-01-09 09:48:14,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:14,721 INFO L471 AbstractCegarLoop]: Abstraction has 3739 states and 6194 transitions. [2025-01-09 09:48:14,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-01-09 09:48:14,721 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 6194 transitions. [2025-01-09 09:48:14,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2025-01-09 09:48:14,726 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:14,726 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:14,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:48:14,727 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:14,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:14,727 INFO L85 PathProgramCache]: Analyzing trace with hash 456236498, now seen corresponding path program 1 times [2025-01-09 09:48:14,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:14,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407292828] [2025-01-09 09:48:14,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:14,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:14,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 579 statements into 1 equivalence classes. [2025-01-09 09:48:14,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 579 of 579 statements. [2025-01-09 09:48:14,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:14,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:15,434 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-01-09 09:48:15,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:15,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407292828] [2025-01-09 09:48:15,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407292828] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:15,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:15,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:48:15,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10536757] [2025-01-09 09:48:15,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:15,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:48:15,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:15,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:48:15,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:48:15,437 INFO L87 Difference]: Start difference. First operand 3739 states and 6194 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-01-09 09:48:16,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:16,040 INFO L93 Difference]: Finished difference Result 9752 states and 16104 transitions. [2025-01-09 09:48:16,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:48:16,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 579 [2025-01-09 09:48:16,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:16,106 INFO L225 Difference]: With dead ends: 9752 [2025-01-09 09:48:16,107 INFO L226 Difference]: Without dead ends: 6016 [2025-01-09 09:48:16,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:48:16,117 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 412 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:16,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 1035 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:48:16,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6016 states. [2025-01-09 09:48:16,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6016 to 6006. [2025-01-09 09:48:16,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6006 states, 3849 states have (on average 1.4710314367368147) internal successors, (5662), 3883 states have internal predecessors, (5662), 2114 states have call successors, (2114), 42 states have call predecessors, (2114), 42 states have return successors, (2114), 2080 states have call predecessors, (2114), 2114 states have call successors, (2114) [2025-01-09 09:48:16,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6006 states to 6006 states and 9890 transitions. [2025-01-09 09:48:16,552 INFO L78 Accepts]: Start accepts. Automaton has 6006 states and 9890 transitions. Word has length 579 [2025-01-09 09:48:16,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:16,553 INFO L471 AbstractCegarLoop]: Abstraction has 6006 states and 9890 transitions. [2025-01-09 09:48:16,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-01-09 09:48:16,553 INFO L276 IsEmpty]: Start isEmpty. Operand 6006 states and 9890 transitions. [2025-01-09 09:48:16,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2025-01-09 09:48:16,559 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:16,559 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:16,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 09:48:16,560 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:16,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:16,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1593151344, now seen corresponding path program 1 times [2025-01-09 09:48:16,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:16,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821061657] [2025-01-09 09:48:16,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:16,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:16,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 579 statements into 1 equivalence classes. [2025-01-09 09:48:16,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 579 of 579 statements. [2025-01-09 09:48:16,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:16,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:17,297 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-01-09 09:48:17,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:17,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821061657] [2025-01-09 09:48:17,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821061657] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:17,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:17,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:48:17,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624606715] [2025-01-09 09:48:17,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:17,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:48:17,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:17,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:48:17,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:48:17,304 INFO L87 Difference]: Start difference. First operand 6006 states and 9890 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-01-09 09:48:17,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:17,844 INFO L93 Difference]: Finished difference Result 16549 states and 27220 transitions. [2025-01-09 09:48:17,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:48:17,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 579 [2025-01-09 09:48:17,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:17,919 INFO L225 Difference]: With dead ends: 16549 [2025-01-09 09:48:17,919 INFO L226 Difference]: Without dead ends: 10546 [2025-01-09 09:48:17,946 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 09:48:17,947 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 240 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:17,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 890 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:48:17,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10546 states. [2025-01-09 09:48:18,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10546 to 10544. [2025-01-09 09:48:18,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10544 states, 6695 states have (on average 1.4589992531740104) internal successors, (9768), 6757 states have internal predecessors, (9768), 3774 states have call successors, (3774), 74 states have call predecessors, (3774), 74 states have return successors, (3774), 3712 states have call predecessors, (3774), 3774 states have call successors, (3774) [2025-01-09 09:48:18,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10544 states to 10544 states and 17316 transitions. [2025-01-09 09:48:18,796 INFO L78 Accepts]: Start accepts. Automaton has 10544 states and 17316 transitions. Word has length 579 [2025-01-09 09:48:18,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:18,797 INFO L471 AbstractCegarLoop]: Abstraction has 10544 states and 17316 transitions. [2025-01-09 09:48:18,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-01-09 09:48:18,798 INFO L276 IsEmpty]: Start isEmpty. Operand 10544 states and 17316 transitions. [2025-01-09 09:48:18,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2025-01-09 09:48:18,806 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:18,806 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:18,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 09:48:18,807 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:18,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:18,808 INFO L85 PathProgramCache]: Analyzing trace with hash 330076690, now seen corresponding path program 1 times [2025-01-09 09:48:18,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:18,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547139751] [2025-01-09 09:48:18,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:18,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:18,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 579 statements into 1 equivalence classes. [2025-01-09 09:48:18,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 579 of 579 statements. [2025-01-09 09:48:18,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:18,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:19,434 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-01-09 09:48:19,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:19,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547139751] [2025-01-09 09:48:19,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547139751] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:19,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:19,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:48:19,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414473578] [2025-01-09 09:48:19,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:19,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:48:19,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:19,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:48:19,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:48:19,437 INFO L87 Difference]: Start difference. First operand 10544 states and 17316 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-01-09 09:48:21,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:21,535 INFO L93 Difference]: Finished difference Result 50122 states and 82154 transitions. [2025-01-09 09:48:21,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:48:21,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 579 [2025-01-09 09:48:21,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:21,716 INFO L225 Difference]: With dead ends: 50122 [2025-01-09 09:48:21,717 INFO L226 Difference]: Without dead ends: 39581 [2025-01-09 09:48:21,761 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 09:48:21,762 INFO L435 NwaCegarLoop]: 723 mSDtfsCounter, 898 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 1946 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:21,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 1946 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:48:21,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39581 states. [2025-01-09 09:48:24,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39581 to 39539. [2025-01-09 09:48:24,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39539 states, 25002 states have (on average 1.4384449244060475) internal successors, (35964), 25270 states have internal predecessors, (35964), 14244 states have call successors, (14244), 292 states have call predecessors, (14244), 292 states have return successors, (14244), 13976 states have call predecessors, (14244), 14244 states have call successors, (14244) [2025-01-09 09:48:24,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39539 states to 39539 states and 64452 transitions. [2025-01-09 09:48:24,887 INFO L78 Accepts]: Start accepts. Automaton has 39539 states and 64452 transitions. Word has length 579 [2025-01-09 09:48:24,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:24,888 INFO L471 AbstractCegarLoop]: Abstraction has 39539 states and 64452 transitions. [2025-01-09 09:48:24,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-01-09 09:48:24,888 INFO L276 IsEmpty]: Start isEmpty. Operand 39539 states and 64452 transitions. [2025-01-09 09:48:24,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2025-01-09 09:48:24,906 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:24,906 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:24,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 09:48:24,906 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:24,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:24,907 INFO L85 PathProgramCache]: Analyzing trace with hash -681040560, now seen corresponding path program 1 times [2025-01-09 09:48:24,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:24,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128494665] [2025-01-09 09:48:24,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:24,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:24,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 579 statements into 1 equivalence classes. [2025-01-09 09:48:24,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 579 of 579 statements. [2025-01-09 09:48:24,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:24,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:26,305 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-01-09 09:48:26,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:26,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128494665] [2025-01-09 09:48:26,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128494665] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:26,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:26,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:48:26,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409800516] [2025-01-09 09:48:26,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:26,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:48:26,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:26,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:48:26,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:48:26,307 INFO L87 Difference]: Start difference. First operand 39539 states and 64452 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-01-09 09:48:37,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:37,814 INFO L93 Difference]: Finished difference Result 215057 states and 350251 transitions. [2025-01-09 09:48:37,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 09:48:37,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 579 [2025-01-09 09:48:37,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:38,709 INFO L225 Difference]: With dead ends: 215057 [2025-01-09 09:48:38,709 INFO L226 Difference]: Without dead ends: 175521 [2025-01-09 09:48:38,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:48:38,914 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 1314 mSDsluCounter, 1388 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1314 SdHoareTripleChecker+Valid, 2057 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:38,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1314 Valid, 2057 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 09:48:39,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175521 states. [2025-01-09 09:48:49,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175521 to 122821. [2025-01-09 09:48:49,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122821 states, 81076 states have (on average 1.473802358281119) internal successors, (119490), 81900 states have internal predecessors, (119490), 40872 states have call successors, (40872), 872 states have call predecessors, (40872), 872 states have return successors, (40872), 40048 states have call predecessors, (40872), 40872 states have call successors, (40872) [2025-01-09 09:48:50,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122821 states to 122821 states and 201234 transitions. [2025-01-09 09:48:50,534 INFO L78 Accepts]: Start accepts. Automaton has 122821 states and 201234 transitions. Word has length 579 [2025-01-09 09:48:50,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:50,535 INFO L471 AbstractCegarLoop]: Abstraction has 122821 states and 201234 transitions. [2025-01-09 09:48:50,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-01-09 09:48:50,535 INFO L276 IsEmpty]: Start isEmpty. Operand 122821 states and 201234 transitions. [2025-01-09 09:48:50,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2025-01-09 09:48:50,594 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:50,594 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:50,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 09:48:50,594 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:50,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:50,595 INFO L85 PathProgramCache]: Analyzing trace with hash 20559314, now seen corresponding path program 1 times [2025-01-09 09:48:50,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:50,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715562129] [2025-01-09 09:48:50,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:50,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:50,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 579 statements into 1 equivalence classes. [2025-01-09 09:48:50,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 579 of 579 statements. [2025-01-09 09:48:50,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:50,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:50,951 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-01-09 09:48:50,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:50,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715562129] [2025-01-09 09:48:50,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715562129] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:50,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:50,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:48:50,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788469128] [2025-01-09 09:48:50,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:50,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:48:50,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:50,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:48:50,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:48:50,953 INFO L87 Difference]: Start difference. First operand 122821 states and 201234 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94)